Base | Representation |
---|---|
bin | 111100100101010011… |
… | …1111101111000100111 |
3 | 110102210222000002020102 |
4 | 1321022213331320213 |
5 | 4112421324304314 |
6 | 135433444054315 |
7 | 12254011224014 |
oct | 1711247757047 |
9 | 412728002212 |
10 | 130101009959 |
11 | 501a26a0438 |
12 | 2126a69439b |
13 | c364aacc3b |
14 | 6422a8070b |
15 | 35b6b675de |
hex | 1e4a9fde27 |
130101009959 has 2 divisors, whose sum is σ = 130101009960. Its totient is φ = 130101009958.
The previous prime is 130101009947. The next prime is 130101009991. The reversal of 130101009959 is 959900101031.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130101009959 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130101009919) 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, 65050504979 + 65050504980.
It is an arithmetic number, because the mean of its divisors is an integer number (65050504980).
Almost surely, 2130101009959 is an apocalyptic number.
130101009959 is a deficient number, since it is larger than the sum of its proper divisors (1).
130101009959 is an equidigital number, since it uses as much as digits as its factorization.
130101009959 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10935, while the sum is 38.
The spelling of 130101009959 in words is "one hundred thirty billion, one hundred one million, nine thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •