Base | Representation |
---|---|
bin | 1001001110010000000011… |
… | …0110010110101000000011 |
3 | 1022220102020010212202020012 |
4 | 2103210000312112220003 |
5 | 2312120101100044212 |
6 | 33322241122535135 |
7 | 2064423234055661 |
oct | 223440066265003 |
9 | 38812203782205 |
10 | 10140432034307 |
11 | 325a595582a03 |
12 | 117934a2074ab |
13 | 587314396a03 |
14 | 270b29c9dc31 |
15 | 128b98a54922 |
hex | 93900d96a03 |
10140432034307 has 2 divisors, whose sum is σ = 10140432034308. Its totient is φ = 10140432034306.
The previous prime is 10140432034301. The next prime is 10140432034339. The reversal of 10140432034307 is 70343023404101.
It is a happy number.
It is an a-pointer prime, because the next prime (10140432034339) can be obtained adding 10140432034307 to its sum of digits (32).
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10140432034307 is a prime.
It is not a weakly prime, because it can be changed into another prime (10140432034301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5070216017153 + 5070216017154.
It is an arithmetic number, because the mean of its divisors is an integer number (5070216017154).
Almost surely, 210140432034307 is an apocalyptic number.
10140432034307 is a deficient number, since it is larger than the sum of its proper divisors (1).
10140432034307 is an equidigital number, since it uses as much as digits as its factorization.
10140432034307 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24192, while the sum is 32.
Adding to 10140432034307 its reverse (70343023404101), we get a palindrome (80483455438408).
The spelling of 10140432034307 in words is "ten trillion, one hundred forty billion, four hundred thirty-two million, thirty-four thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •