Base | Representation |
---|---|
bin | 111100101000101010… |
… | …0001001101111011001 |
3 | 110110002210012210001212 |
4 | 1321101110021233121 |
5 | 4113134043144103 |
6 | 135452533552505 |
7 | 12256543262261 |
oct | 1712124115731 |
9 | 413083183055 |
10 | 130213256153 |
11 | 5024aa96692 |
12 | 212a01a5735 |
13 | c3821207c6 |
14 | 643393c7a1 |
15 | 35c193a7d8 |
hex | 1e51509bd9 |
130213256153 has 2 divisors, whose sum is σ = 130213256154. Its totient is φ = 130213256152.
The previous prime is 130213256053. The next prime is 130213256167. The reversal of 130213256153 is 351652312031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 82180835584 + 48032420569 = 286672^2 + 219163^2 .
It is a cyclic number.
It is not a de Polignac number, because 130213256153 - 28 = 130213255897 is a prime.
It is not a weakly prime, because it can be changed into another prime (130213256053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65106628076 + 65106628077.
It is an arithmetic number, because the mean of its divisors is an integer number (65106628077).
Almost surely, 2130213256153 is an apocalyptic number.
It is an amenable number.
130213256153 is a deficient number, since it is larger than the sum of its proper divisors (1).
130213256153 is an equidigital number, since it uses as much as digits as its factorization.
130213256153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16200, while the sum is 32.
Adding to 130213256153 its reverse (351652312031), we get a palindrome (481865568184).
The spelling of 130213256153 in words is "one hundred thirty billion, two hundred thirteen million, two hundred fifty-six thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •