Base | Representation |
---|---|
bin | 1001000110000101101110… |
… | …0011111110010111001101 |
3 | 1022102000022112020112120112 |
4 | 2101201123203332113031 |
5 | 2302320422311202341 |
6 | 33134012044525405 |
7 | 2051330526452432 |
oct | 221413343762715 |
9 | 38360275215515 |
10 | 10000220022221 |
11 | 3206084551a70 |
12 | 1156139550865 |
13 | 57702a9030a0 |
14 | 268028443b89 |
15 | 1251de404aeb |
hex | 9185b8fe5cd |
10000220022221 has 16 divisors (see below), whose sum is σ = 11798933065920. Its totient is φ = 8355776718720.
The previous prime is 10000220022197. The next prime is 10000220022227. The reversal of 10000220022221 is 12222002200001.
It is a cyclic number.
It is not a de Polignac number, because 10000220022221 - 238 = 9725342115277 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10000220022196 and 10000220022205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10000220022227) 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, 150034511 + ... + 150101148.
It is an arithmetic number, because the mean of its divisors is an integer number (737433316620).
Almost surely, 210000220022221 is an apocalyptic number.
10000220022221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10000220022221 is a deficient number, since it is larger than the sum of its proper divisors (1798713043699).
10000220022221 is a wasteful number, since it uses less digits than its factorization.
10000220022221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 300135916.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 10000220022221 its reverse (12222002200001), we get a palindrome (22222222222222).
The spelling of 10000220022221 in words is "ten trillion, two hundred twenty million, twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •