Base | Representation |
---|---|
bin | 10010111000110110… |
… | …01001100101100011 |
3 | 222011201020121012001 |
4 | 21130123021211203 |
5 | 131231440234434 |
6 | 4354123144431 |
7 | 506202205045 |
oct | 113433114543 |
9 | 28151217161 |
10 | 10140555619 |
11 | 4334096587 |
12 | 1b70075117 |
13 | c57b6068c |
14 | 6c2aada95 |
15 | 3e53c4114 |
hex | 25c6c9963 |
10140555619 has 2 divisors, whose sum is σ = 10140555620. Its totient is φ = 10140555618.
The previous prime is 10140555521. The next prime is 10140555631. The reversal of 10140555619 is 91655504101.
10140555619 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10140555619 - 29 = 10140555107 is a prime.
It is a super-2 number, since 2×101405556192 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10140555679) 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, 5070277809 + 5070277810.
It is an arithmetic number, because the mean of its divisors is an integer number (5070277810).
Almost surely, 210140555619 is an apocalyptic number.
10140555619 is a deficient number, since it is larger than the sum of its proper divisors (1).
10140555619 is an equidigital number, since it uses as much as digits as its factorization.
10140555619 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27000, while the sum is 37.
The spelling of 10140555619 in words is "ten billion, one hundred forty million, five hundred fifty-five thousand, six hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •