Base | Representation |
---|---|
bin | 1001001110100001111011… |
… | …0111011110001101110111 |
3 | 1022220212121120020201101201 |
4 | 2103220132313132031313 |
5 | 2312204413014030234 |
6 | 33324353221033331 |
7 | 2064653162231266 |
oct | 223503667361567 |
9 | 38825546221351 |
10 | 10145230611319 |
11 | 3261628215931 |
12 | 117a269255847 |
13 | 5878ca5906ab |
14 | 2710632cc5dd |
15 | 128d79e70314 |
hex | 93a1edde377 |
10145230611319 has 2 divisors, whose sum is σ = 10145230611320. Its totient is φ = 10145230611318.
The previous prime is 10145230611223. The next prime is 10145230611389. The reversal of 10145230611319 is 91311603254101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10145230611319 - 213 = 10145230603127 is a prime.
It is a super-2 number, since 2×101452306113192 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10145230611389) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5072615305659 + 5072615305660.
It is an arithmetic number, because the mean of its divisors is an integer number (5072615305660).
Almost surely, 210145230611319 is an apocalyptic number.
10145230611319 is a deficient number, since it is larger than the sum of its proper divisors (1).
10145230611319 is an equidigital number, since it uses as much as digits as its factorization.
10145230611319 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19440, while the sum is 37.
The spelling of 10145230611319 in words is "ten trillion, one hundred forty-five billion, two hundred thirty million, six hundred eleven thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •