Base | Representation |
---|---|
bin | 111111100001001… |
… | …0000111100111001 |
3 | 12111112102021011201 |
4 | 1333002100330321 |
5 | 13331103101103 |
6 | 551253054201 |
7 | 103546516033 |
oct | 17702207471 |
9 | 5445367151 |
10 | 2131300153 |
11 | 9a4077394 |
12 | 4b5927361 |
13 | 27c729868 |
14 | 1630b6c53 |
15 | c719b51d |
hex | 7f090f39 |
2131300153 has 2 divisors, whose sum is σ = 2131300154. Its totient is φ = 2131300152.
The previous prime is 2131300147. The next prime is 2131300273. The reversal of 2131300153 is 3510031312.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1808630784 + 322669369 = 42528^2 + 17963^2 .
It is a cyclic number.
It is not a de Polignac number, because 2131300153 - 221 = 2129203001 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2131300153.
It is not a weakly prime, because it can be changed into another prime (2131300123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1065650076 + 1065650077.
It is an arithmetic number, because the mean of its divisors is an integer number (1065650077).
Almost surely, 22131300153 is an apocalyptic number.
It is an amenable number.
2131300153 is a deficient number, since it is larger than the sum of its proper divisors (1).
2131300153 is an equidigital number, since it uses as much as digits as its factorization.
2131300153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 19.
The square root of 2131300153 is about 46166.0064657969. The cubic root of 2131300153 is about 1286.9100882287.
Adding to 2131300153 its reverse (3510031312), we get a palindrome (5641331465).
The spelling of 2131300153 in words is "two billion, one hundred thirty-one million, three hundred thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •