Base | Representation |
---|---|
bin | 111100101000110111… |
… | …0101011111110011001 |
3 | 110110010021022011212022 |
4 | 1321101232223332121 |
5 | 4113142333241441 |
6 | 135453343024225 |
7 | 12256656353126 |
oct | 1712156537631 |
9 | 413107264768 |
10 | 130220212121 |
11 | 50253a0781a |
12 | 212a259b075 |
13 | c3836b796c |
14 | 643482d74d |
15 | 35c236184b |
hex | 1e51babf99 |
130220212121 has 2 divisors, whose sum is σ = 130220212122. Its totient is φ = 130220212120.
The previous prime is 130220212103. The next prime is 130220212169. The reversal of 130220212121 is 121212022031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 76764460096 + 53455752025 = 277064^2 + 231205^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130220212121 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130220212121.
It is not a weakly prime, because it can be changed into another prime (130220212181) 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, 65110106060 + 65110106061.
It is an arithmetic number, because the mean of its divisors is an integer number (65110106061).
Almost surely, 2130220212121 is an apocalyptic number.
It is an amenable number.
130220212121 is a deficient number, since it is larger than the sum of its proper divisors (1).
130220212121 is an equidigital number, since it uses as much as digits as its factorization.
130220212121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 130220212121 its reverse (121212022031), we get a palindrome (251432234152).
The spelling of 130220212121 in words is "one hundred thirty billion, two hundred twenty million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •