Base | Representation |
---|---|
bin | 11111000001110111000… |
… | …000010010101110110001 |
3 | 21112211211200021200122202 |
4 | 133001313000102232301 |
5 | 234413422342003431 |
6 | 4311322032312545 |
7 | 310024250606264 |
oct | 37016700225661 |
9 | 7484750250582 |
10 | 2132300344241 |
11 | 752337a56661 |
12 | 2a53070a2755 |
13 | 1260c8ba1932 |
14 | 752bd676cdb |
15 | 3a6ecc7e8cb |
hex | 1f077012bb1 |
2132300344241 has 2 divisors, whose sum is σ = 2132300344242. Its totient is φ = 2132300344240.
The previous prime is 2132300344231. The next prime is 2132300344253. The reversal of 2132300344241 is 1424430032312.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1581736344241 + 550564000000 = 1257671^2 + 742000^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2132300344241 is a prime.
It is a super-4 number, since 4×21323003442414 (a number of 50 digits) contains 4444 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 (2132300344231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1066150172120 + 1066150172121.
It is an arithmetic number, because the mean of its divisors is an integer number (1066150172121).
Almost surely, 22132300344241 is an apocalyptic number.
It is an amenable number.
2132300344241 is a deficient number, since it is larger than the sum of its proper divisors (1).
2132300344241 is an equidigital number, since it uses as much as digits as its factorization.
2132300344241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 2132300344241 its reverse (1424430032312), we get a palindrome (3556730376553).
The spelling of 2132300344241 in words is "two trillion, one hundred thirty-two billion, three hundred million, three hundred forty-four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •