Base | Representation |
---|---|
bin | 1001001110100001111011… |
… | …0111011110001100000011 |
3 | 1022220212121120020201020102 |
4 | 2103220132313132030003 |
5 | 2312204413014024303 |
6 | 33324353221033015 |
7 | 2064653162231042 |
oct | 223503667361403 |
9 | 38825546221212 |
10 | 10145230611203 |
11 | 3261628215836 |
12 | 117a26925576b |
13 | 5878ca59061c |
14 | 2710632cc559 |
15 | 128d79e70288 |
hex | 93a1edde303 |
10145230611203 has 2 divisors, whose sum is σ = 10145230611204. Its totient is φ = 10145230611202.
The previous prime is 10145230611179. The next prime is 10145230611223. The reversal of 10145230611203 is 30211603254101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10145230611203 - 28 = 10145230610947 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (10145230611223) 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, 5072615305601 + 5072615305602.
It is an arithmetic number, because the mean of its divisors is an integer number (5072615305602).
Almost surely, 210145230611203 is an apocalyptic number.
10145230611203 is a deficient number, since it is larger than the sum of its proper divisors (1).
10145230611203 is an equidigital number, since it uses as much as digits as its factorization.
10145230611203 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 29.
Adding to 10145230611203 its reverse (30211603254101), we get a palindrome (40356833865304).
The spelling of 10145230611203 in words is "ten trillion, one hundred forty-five billion, two hundred thirty million, six hundred eleven thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •