Base | Representation |
---|---|
bin | 1001010001101110101111… |
… | …1101000001001010100110 |
3 | 1100010010112020112221200111 |
4 | 2110123223331001022212 |
5 | 2314110013004031042 |
6 | 33405525013403234 |
7 | 2101640510650456 |
oct | 224335375011246 |
9 | 40103466487614 |
10 | 10200211002022 |
11 | 3282981212158 |
12 | 1188a5203951a |
13 | 58cb500b4662 |
14 | 27399b257d66 |
15 | 12a4e6b96517 |
hex | 946ebf412a6 |
10200211002022 has 8 divisors (see below), whose sum is σ = 15304871534400. Its totient is φ = 5098587157224.
The previous prime is 10200211001993. The next prime is 10200211002029. The reversal of 10200211002022 is 22020011200201.
It is a happy number.
10200211002022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 10200211001993 and 10200211002011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10200211002029) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 759163497 + ... + 759176932.
It is an arithmetic number, because the mean of its divisors is an integer number (1913108941800).
Almost surely, 210200211002022 is an apocalyptic number.
10200211002022 is a deficient number, since it is larger than the sum of its proper divisors (5104660532378).
10200211002022 is a wasteful number, since it uses less digits than its factorization.
10200211002022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1518343790.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 10200211002022 its reverse (22020011200201), we get a palindrome (32220222202223).
The spelling of 10200211002022 in words is "ten trillion, two hundred billion, two hundred eleven million, two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •