Base | Representation |
---|---|
bin | 10110110010000110101101… |
… | …010101110011010101000101 |
3 | 111010210001020020100112202112 |
4 | 112302012231111303111011 |
5 | 101113140002224101041 |
6 | 553035200404150405 |
7 | 30051140241020024 |
oct | 2662065525632505 |
9 | 433701206315675 |
10 | 100200200222021 |
11 | 29a217368a2119 |
12 | b2a3578398405 |
13 | 43baab8a99493 |
14 | 1aa5a037328bb |
15 | b8b6855e3deb |
hex | 5b21ad573545 |
100200200222021 has 16 divisors (see below), whose sum is σ = 103757403340800. Its totient is φ = 96663497588400.
The previous prime is 100200200221939. The next prime is 100200200222027. The reversal of 100200200222021 is 120222002002001.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100200200222021 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 100200200221987 and 100200200222005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100200200222027) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29775716 + ... + 32969586.
It is an arithmetic number, because the mean of its divisors is an integer number (6484837708800).
Almost surely, 2100200200222021 is an apocalyptic number.
It is an amenable number.
100200200222021 is a deficient number, since it is larger than the sum of its proper divisors (3557203118779).
100200200222021 is a wasteful number, since it uses less digits than its factorization.
100200200222021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3197080.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 100200200222021 its reverse (120222002002001), we get a palindrome (220422202224022).
The spelling of 100200200222021 in words is "one hundred trillion, two hundred billion, two hundred million, two hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •