Base | Representation |
---|---|
bin | 1001010010111100111100… |
… | …0000011100111111011001 |
3 | 1100012010201000102122222002 |
4 | 2110233033000130333121 |
5 | 2314431004222342031 |
6 | 33423315441010345 |
7 | 2103312604124444 |
oct | 224571700347731 |
9 | 40163630378862 |
10 | 10221200199641 |
11 | 3290872056a72 |
12 | 1190b2b3239b5 |
13 | 591b166b6612 |
14 | 2749cca7865b |
15 | 12ad246acccb |
hex | 94bcf01cfd9 |
10221200199641 has 2 divisors, whose sum is σ = 10221200199642. Its totient is φ = 10221200199640.
The previous prime is 10221200199611. The next prime is 10221200199733. The reversal of 10221200199641 is 14699100212201.
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., 9496079828041 + 725120371600 = 3081571^2 + 851540^2 .
It is a cyclic number.
It is not a de Polignac number, because 10221200199641 - 210 = 10221200198617 is a prime.
It is a super-2 number, since 2×102212001996412 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10221200199595 and 10221200199604.
It is not a weakly prime, because it can be changed into another prime (10221200199611) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110600099820 + 5110600099821.
It is an arithmetic number, because the mean of its divisors is an integer number (5110600099821).
Almost surely, 210221200199641 is an apocalyptic number.
It is an amenable number.
10221200199641 is a deficient number, since it is larger than the sum of its proper divisors (1).
10221200199641 is an equidigital number, since it uses as much as digits as its factorization.
10221200199641 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15552, while the sum is 38.
The spelling of 10221200199641 in words is "ten trillion, two hundred twenty-one billion, two hundred million, one hundred ninety-nine thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •