Base | Representation |
---|---|
bin | 10110101111011110111001… |
… | …110101011010110001101101 |
3 | 111010010211011020202101111012 |
4 | 112233132321311122301231 |
5 | 101102212000412211341 |
6 | 552420321410435005 |
7 | 30032131236465440 |
oct | 2657367165326155 |
9 | 433124136671435 |
10 | 100020021210221 |
11 | 29962286502802 |
12 | b274672892a65 |
13 | 43a6b03038ab8 |
14 | 1a9adcdc59657 |
15 | b86b3c32a0eb |
hex | 5af7b9d5ac6d |
100020021210221 has 16 divisors (see below), whose sum is σ = 114407897463168. Its totient is φ = 85656973608000.
The previous prime is 100020021210209. The next prime is 100020021210253. The reversal of 100020021210221 is 122012120020001.
It is a cyclic number.
It is not a de Polignac number, because 100020021210221 - 218 = 100020020948077 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 = 100020021210196 and 100020021210205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100020021200221) 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, 482383271 + ... + 482590571.
It is an arithmetic number, because the mean of its divisors is an integer number (7150493591448).
Almost surely, 2100020021210221 is an apocalyptic number.
It is an amenable number.
100020021210221 is a deficient number, since it is larger than the sum of its proper divisors (14387876252947).
100020021210221 is a wasteful number, since it uses less digits than its factorization.
100020021210221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 266852.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 100020021210221 its reverse (122012120020001), we get a palindrome (222032141230222).
The spelling of 100020021210221 in words is "one hundred trillion, twenty billion, twenty-one million, two hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •