Base | Representation |
---|---|
bin | 10010111000110110… |
… | …01001100101111011 |
3 | 222011201020121012221 |
4 | 21130123021211323 |
5 | 131231440240033 |
6 | 4354123144511 |
7 | 506202205111 |
oct | 113433114573 |
9 | 28151217187 |
10 | 10140555643 |
11 | 43340965a9 |
12 | 1b70075137 |
13 | c57b606aa |
14 | 6c2aadab1 |
15 | 3e53c412d |
hex | 25c6c997b |
10140555643 has 2 divisors, whose sum is σ = 10140555644. Its totient is φ = 10140555642.
The previous prime is 10140555631. The next prime is 10140555661. The reversal of 10140555643 is 34655504101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10140555643 - 229 = 9603684731 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10140555599 and 10140555608.
It is not a weakly prime, because it can be changed into another prime (10140555673) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5070277821 + 5070277822.
It is an arithmetic number, because the mean of its divisors is an integer number (5070277822).
Almost surely, 210140555643 is an apocalyptic number.
10140555643 is a deficient number, since it is larger than the sum of its proper divisors (1).
10140555643 is an equidigital number, since it uses as much as digits as its factorization.
10140555643 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36000, while the sum is 34.
The spelling of 10140555643 in words is "ten billion, one hundred forty million, five hundred fifty-five thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •