Base | Representation |
---|---|
bin | 111100110010011101… |
… | …1010111001100101111 |
3 | 110110221201101001010001 |
4 | 1321210323113030233 |
5 | 4114322312130444 |
6 | 135545330325131 |
7 | 12300650154514 |
oct | 1714473271457 |
9 | 413851331101 |
10 | 130542301999 |
11 | 503a97a96aa |
12 | 213724297a7 |
13 | c40534b1a5 |
14 | 646551330b |
15 | 35e07858d4 |
hex | 1e64ed732f |
130542301999 has 2 divisors, whose sum is σ = 130542302000. Its totient is φ = 130542301998.
The previous prime is 130542301991. The next prime is 130542302057. The reversal of 130542301999 is 999103245031.
It is a weak prime.
It is an emirp because it is prime and its reverse (999103245031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130542301999 - 23 = 130542301991 is a prime.
It is a super-2 number, since 2×1305423019992 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130542301991) 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, 65271150999 + 65271151000.
It is an arithmetic number, because the mean of its divisors is an integer number (65271151000).
Almost surely, 2130542301999 is an apocalyptic number.
130542301999 is a deficient number, since it is larger than the sum of its proper divisors (1).
130542301999 is an equidigital number, since it uses as much as digits as its factorization.
130542301999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 262440, while the sum is 46.
The spelling of 130542301999 in words is "one hundred thirty billion, five hundred forty-two million, three hundred one thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •