Base | Representation |
---|---|
bin | 111100100101011000… |
… | …0101111011101110111 |
3 | 110102211010022221120111 |
4 | 1321022300233131313 |
5 | 4112422421411244 |
6 | 135434005243451 |
7 | 12254036614162 |
oct | 1711260573567 |
9 | 412733287514 |
10 | 130103310199 |
11 | 501a3a21665 |
12 | 2126b403587 |
13 | c365406c25 |
14 | 64230bcad9 |
15 | 35b6e6de34 |
hex | 1e4ac2f777 |
130103310199 has 2 divisors, whose sum is σ = 130103310200. Its totient is φ = 130103310198.
The previous prime is 130103310191. The next prime is 130103310223. The reversal of 130103310199 is 991013301031.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 130103310199 - 23 = 130103310191 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130103310199.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130103310191) 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, 65051655099 + 65051655100.
It is an arithmetic number, because the mean of its divisors is an integer number (65051655100).
Almost surely, 2130103310199 is an apocalyptic number.
130103310199 is a deficient number, since it is larger than the sum of its proper divisors (1).
130103310199 is an equidigital number, since it uses as much as digits as its factorization.
130103310199 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2187, while the sum is 31.
The spelling of 130103310199 in words is "one hundred thirty billion, one hundred three million, three hundred ten thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •