Base | Representation |
---|---|
bin | 11111000001110111001… |
… | …010011011001001011001 |
3 | 21112211211212021121212212 |
4 | 133001313022123021121 |
5 | 234413424032001103 |
6 | 4311322205244505 |
7 | 310024312310414 |
oct | 37016712331131 |
9 | 7484755247785 |
10 | 2132303000153 |
11 | 752339500027 |
12 | 2a5307b63735 |
13 | 1260c95c1791 |
14 | 752bdb68b7b |
15 | 3a6ed1067d8 |
hex | 1f07729b259 |
2132303000153 has 2 divisors, whose sum is σ = 2132303000154. Its totient is φ = 2132303000152.
The previous prime is 2132303000119. The next prime is 2132303000159. The reversal of 2132303000153 is 3510003032312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1804285638169 + 328017361984 = 1343237^2 + 572728^2 .
It is a cyclic number.
It is not a de Polignac number, because 2132303000153 - 240 = 1032791372377 is a prime.
It is a super-2 number, since 2×21323030001532 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (2132303000159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1066151500076 + 1066151500077.
It is an arithmetic number, because the mean of its divisors is an integer number (1066151500077).
Almost surely, 22132303000153 is an apocalyptic number.
It is an amenable number.
2132303000153 is a deficient number, since it is larger than the sum of its proper divisors (1).
2132303000153 is an equidigital number, since it uses as much as digits as its factorization.
2132303000153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1620, while the sum is 23.
Adding to 2132303000153 its reverse (3510003032312), we get a palindrome (5642306032465).
The spelling of 2132303000153 in words is "two trillion, one hundred thirty-two billion, three hundred three million, one hundred fifty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •