Base | Representation |
---|---|
bin | 1001010001101110101111… |
… | …1101000001001010100101 |
3 | 1100010010112020112221200110 |
4 | 2110123223331001022211 |
5 | 2314110013004031041 |
6 | 33405525013403233 |
7 | 2101640510650455 |
oct | 224335375011245 |
9 | 40103466487613 |
10 | 10200211002021 |
11 | 3282981212157 |
12 | 1188a52039519 |
13 | 58cb500b4661 |
14 | 27399b257d65 |
15 | 12a4e6b96516 |
hex | 946ebf412a5 |
10200211002021 has 16 divisors (see below), whose sum is σ = 13995625682304. Its totient is φ = 6603199262784.
The previous prime is 10200211001993. The next prime is 10200211002029. The reversal of 10200211002021 is 12020011200201.
10200211002021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10200211002021 - 211 = 10200210999973 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10200211001988 and 10200211002006.
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 15 ways as a sum of consecutive naturals, for example, 91289886 + ... + 91401551.
It is an arithmetic number, because the mean of its divisors is an integer number (874726605144).
Almost surely, 210200211002021 is an apocalyptic number.
It is an amenable number.
10200211002021 is a deficient number, since it is larger than the sum of its proper divisors (3795414680283).
10200211002021 is a wasteful number, since it uses less digits than its factorization.
10200211002021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 182691980.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10200211002021 its reverse (12020011200201), we get a palindrome (22220222202222).
The spelling of 10200211002021 in words is "ten trillion, two hundred billion, two hundred eleven million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •