Base | Representation |
---|---|
bin | 11101011111000110110… |
… | …00101000100010111001 |
3 | 10120212001220222022102022 |
4 | 32233203120220202321 |
5 | 113044343320400441 |
6 | 2053232043044225 |
7 | 133124234416526 |
oct | 16574330504271 |
9 | 3525056868368 |
10 | 1013132200121 |
11 | 360737795248 |
12 | 144427b10675 |
13 | 746cbb76562 |
14 | 3707058614d |
15 | 1b5495cd84b |
hex | ebe36288b9 |
1013132200121 has 2 divisors, whose sum is σ = 1013132200122. Its totient is φ = 1013132200120.
The previous prime is 1013132200037. The next prime is 1013132200133. The reversal of 1013132200121 is 1210022313101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 910232391721 + 102899808400 = 954061^2 + 320780^2 .
It is a cyclic number.
It is not a de Polignac number, because 1013132200121 - 210 = 1013132199097 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1013132200121.
It is not a weakly prime, because it can be changed into another prime (1013132203121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506566100060 + 506566100061.
It is an arithmetic number, because the mean of its divisors is an integer number (506566100061).
Almost surely, 21013132200121 is an apocalyptic number.
It is an amenable number.
1013132200121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013132200121 is an equidigital number, since it uses as much as digits as its factorization.
1013132200121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1013132200121 its reverse (1210022313101), we get a palindrome (2223154513222).
The spelling of 1013132200121 in words is "one trillion, thirteen billion, one hundred thirty-two million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •