Base | Representation |
---|---|
bin | 1011000110010000000001… |
… | …1110001110010101110101 |
3 | 1121012111112001112221000121 |
4 | 2301210000132032111311 |
5 | 3044404204030322442 |
6 | 41541305341411541 |
7 | 2366365116534622 |
oct | 261440036162565 |
9 | 47174461487017 |
10 | 12202010010997 |
11 | 3984930600014 |
12 | 14509b8569bb1 |
13 | 6a684c27c981 |
14 | 30281aa03349 |
15 | 162607a83967 |
hex | b190078e575 |
12202010010997 has 2 divisors, whose sum is σ = 12202010010998. Its totient is φ = 12202010010996.
The previous prime is 12202010010977. The next prime is 12202010011021. The reversal of 12202010010997 is 79901001020221.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9237308018436 + 2964701992561 = 3039294^2 + 1721831^2 .
It is an emirp because it is prime and its reverse (79901001020221) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12202010010997 is a prime.
It is a super-3 number, since 3×122020100109973 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12202010010907) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6101005005498 + 6101005005499.
It is an arithmetic number, because the mean of its divisors is an integer number (6101005005499).
Almost surely, 212202010010997 is an apocalyptic number.
It is an amenable number.
12202010010997 is a deficient number, since it is larger than the sum of its proper divisors (1).
12202010010997 is an equidigital number, since it uses as much as digits as its factorization.
12202010010997 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4536, while the sum is 34.
The spelling of 12202010010997 in words is "twelve trillion, two hundred two billion, ten million, ten thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •