Base | Representation |
---|---|
bin | 11101101000011101000010… |
… | …000100010110111010001111 |
3 | 122002102210012221001220022001 |
4 | 131220131002010112322033 |
5 | 114040204110040214244 |
6 | 1141101410434333131 |
7 | 36310355614550563 |
oct | 3550350204267217 |
9 | 562383187056261 |
10 | 130323301101199 |
11 | 3858588aa4a758 |
12 | 12749641a2a1a7 |
13 | 579458596802b |
14 | 2427977bab6a3 |
15 | 101001c6e25d4 |
hex | 768742116e8f |
130323301101199 has 2 divisors, whose sum is σ = 130323301101200. Its totient is φ = 130323301101198.
The previous prime is 130323301101179. The next prime is 130323301101233. The reversal of 130323301101199 is 991101103323031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 130323301101199 - 211 = 130323301099151 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130323301101139) 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, 65161650550599 + 65161650550600.
It is an arithmetic number, because the mean of its divisors is an integer number (65161650550600).
Almost surely, 2130323301101199 is an apocalyptic number.
130323301101199 is a deficient number, since it is larger than the sum of its proper divisors (1).
130323301101199 is an equidigital number, since it uses as much as digits as its factorization.
130323301101199 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13122, while the sum is 37.
The spelling of 130323301101199 in words is "one hundred thirty trillion, three hundred twenty-three billion, three hundred one million, one hundred one thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •