Base | Representation |
---|---|
bin | 1001001100100000101110… |
… | …11111101001010011111101 |
3 | 2122121010012020111110201222 |
4 | 10212100113133221103331 |
5 | 10122300303122414323 |
6 | 111001240054443125 |
7 | 4154632466514332 |
oct | 446202737512375 |
9 | 78533166443658 |
10 | 20221100201213 |
11 | 64967a199a75a |
12 | 2326b996634a5 |
13 | b38ac2bcbc72 |
14 | 4dc9c67b6989 |
15 | 250ee594b9c8 |
hex | 1264177e94fd |
20221100201213 has 2 divisors, whose sum is σ = 20221100201214. Its totient is φ = 20221100201212.
The previous prime is 20221100201173. The next prime is 20221100201233. The reversal of 20221100201213 is 31210200112202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19974803385124 + 246296816089 = 4469318^2 + 496283^2 .
It is a cyclic number.
It is not a de Polignac number, because 20221100201213 - 218 = 20221099939069 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20221100201191 and 20221100201200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20221100201233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10110550100606 + 10110550100607.
It is an arithmetic number, because the mean of its divisors is an integer number (10110550100607).
Almost surely, 220221100201213 is an apocalyptic number.
It is an amenable number.
20221100201213 is a deficient number, since it is larger than the sum of its proper divisors (1).
20221100201213 is an equidigital number, since it uses as much as digits as its factorization.
20221100201213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 20221100201213 its reverse (31210200112202), we get a palindrome (51431300313415).
The spelling of 20221100201213 in words is "twenty trillion, two hundred twenty-one billion, one hundred million, two hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •