Base | Representation |
---|---|
bin | 1001001000011011111010… |
… | …0001011010100110111011 |
3 | 1022112212101010222200110101 |
4 | 2102012332201122212323 |
5 | 2304001003430022111 |
6 | 33204320314500231 |
7 | 2054255550231316 |
oct | 222067641324673 |
9 | 38485333880411 |
10 | 10040535001531 |
11 | 3221192285691 |
12 | 1161b0aa34677 |
13 | 57aa83cc9528 |
14 | 269d707a397d |
15 | 12629d8a8bc1 |
hex | 921be85a9bb |
10040535001531 has 2 divisors, whose sum is σ = 10040535001532. Its totient is φ = 10040535001530.
The previous prime is 10040535001517. The next prime is 10040535001597. The reversal of 10040535001531 is 13510053504001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10040535001531 - 211 = 10040534999483 is a prime.
It is a super-2 number, since 2×100405350015312 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10040535001531.
It is not a weakly prime, because it can be changed into another prime (10040535001331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5020267500765 + 5020267500766.
It is an arithmetic number, because the mean of its divisors is an integer number (5020267500766).
Almost surely, 210040535001531 is an apocalyptic number.
10040535001531 is a deficient number, since it is larger than the sum of its proper divisors (1).
10040535001531 is an equidigital number, since it uses as much as digits as its factorization.
10040535001531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4500, while the sum is 28.
Adding to 10040535001531 its reverse (13510053504001), we get a palindrome (23550588505532).
The spelling of 10040535001531 in words is "ten trillion, forty billion, five hundred thirty-five million, one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •