Base | Representation |
---|---|
bin | 10001011111100011111… |
… | …111101100010001001101 |
3 | 11020220212212202002000111 |
4 | 101133203333230101031 |
5 | 124143420434000023 |
6 | 2320125145000021 |
7 | 152564451622363 |
oct | 21374377542115 |
9 | 4226785662014 |
10 | 1202121000013 |
11 | 4238a8a6886a |
12 | 174b8ba83011 |
13 | 89489b491bb |
14 | 4227c0bd633 |
15 | 2140b00000d |
hex | 117e3fec44d |
1202121000013 has 2 divisors, whose sum is σ = 1202121000014. Its totient is φ = 1202121000012.
The previous prime is 1202121000011. The next prime is 1202121000029. The reversal of 1202121000013 is 3100001212021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 838363646884 + 363757353129 = 915622^2 + 603123^2 .
It is a cyclic number.
It is not a de Polignac number, because 1202121000013 - 21 = 1202121000011 is a prime.
Together with 1202121000011, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1202120999957 and 1202121000002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1202121000011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 601060500006 + 601060500007.
It is an arithmetic number, because the mean of its divisors is an integer number (601060500007).
Almost surely, 21202121000013 is an apocalyptic number.
It is an amenable number.
1202121000013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1202121000013 is an equidigital number, since it uses as much as digits as its factorization.
1202121000013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 1202121000013 its reverse (3100001212021), we get a palindrome (4302122212034).
The spelling of 1202121000013 in words is "one trillion, two hundred two billion, one hundred twenty-one million, thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •