Base | Representation |
---|---|
bin | 10010111001011100… |
… | …00000110111010011 |
3 | 222012001112211110111 |
4 | 21130232000313103 |
5 | 131234222010002 |
6 | 4354421142151 |
7 | 506262222013 |
oct | 113456006723 |
9 | 28161484414 |
10 | 10145500627 |
11 | 4336963869 |
12 | 1b7185a957 |
13 | c58ba2412 |
14 | 6c35d9c43 |
15 | 3e5a4e3d7 |
hex | 25cb80dd3 |
10145500627 has 2 divisors, whose sum is σ = 10145500628. Its totient is φ = 10145500626.
The previous prime is 10145500597. The next prime is 10145500639. The reversal of 10145500627 is 72600554101.
10145500627 is digitally balanced in base 2, because in such base 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 10145500627 - 211 = 10145498579 is a prime.
It is not a weakly prime, because it can be changed into another prime (10145500327) 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, 5072750313 + 5072750314.
It is an arithmetic number, because the mean of its divisors is an integer number (5072750314).
Almost surely, 210145500627 is an apocalyptic number.
10145500627 is a deficient number, since it is larger than the sum of its proper divisors (1).
10145500627 is an equidigital number, since it uses as much as digits as its factorization.
10145500627 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8400, while the sum is 31.
The spelling of 10145500627 in words is "ten billion, one hundred forty-five million, five hundred thousand, six hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •