Base | Representation |
---|---|
bin | 1011000110010000010111… |
… | …1001101111110011001101 |
3 | 1121012111202101222100010022 |
4 | 2301210011321233303031 |
5 | 3044404400341041023 |
6 | 41541322354151525 |
7 | 2366400304064351 |
oct | 261440571576315 |
9 | 47174671870108 |
10 | 12202101112013 |
11 | 3984977a7360a |
12 | 1450a22b825a5 |
13 | 6a68650c8ab7 |
14 | 302828b59461 |
15 | 162610a7b7c8 |
hex | b1905e6fccd |
12202101112013 has 2 divisors, whose sum is σ = 12202101112014. Its totient is φ = 12202101112012.
The previous prime is 12202101111919. The next prime is 12202101112073. The reversal of 12202101112013 is 31021110120221.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12140081684644 + 62019427369 = 3484262^2 + 249037^2 .
It is a cyclic number.
It is not a de Polignac number, because 12202101112013 - 226 = 12202034003149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12202101111982 and 12202101112000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12202101112073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6101050556006 + 6101050556007.
It is an arithmetic number, because the mean of its divisors is an integer number (6101050556007).
Almost surely, 212202101112013 is an apocalyptic number.
It is an amenable number.
12202101112013 is a deficient number, since it is larger than the sum of its proper divisors (1).
12202101112013 is an equidigital number, since it uses as much as digits as its factorization.
12202101112013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 12202101112013 its reverse (31021110120221), we get a palindrome (43223211232234).
The spelling of 12202101112013 in words is "twelve trillion, two hundred two billion, one hundred one million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •