Base | Representation |
---|---|
bin | 1001010010111100111100… |
… | …0000100001111101101010 |
3 | 1100012010201000110200220111 |
4 | 2110233033000201331222 |
5 | 2314431004224020020 |
6 | 33423315441244534 |
7 | 2103312604241023 |
oct | 224571700417552 |
9 | 40163630420814 |
10 | 10221200220010 |
11 | 32908720702aa |
12 | 1190b2b33374a |
13 | 591b166c2980 |
14 | 2749cca81c4a |
15 | 12ad246b3d5a |
hex | 94bcf021f6a |
10221200220010 has 64 divisors (see below), whose sum is σ = 20119639815072. Its totient is φ = 3715830153216.
The previous prime is 10221200219953. The next prime is 10221200220017. The reversal of 10221200220010 is 1002200212201.
It is a happy number.
10221200220010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 16 ways, for example, as 636151403281 + 9585048816729 = 797591^2 + 3095973^2 .
It is a Harshad number since it is a multiple of its sum of digits (13).
It is not an unprimeable number, because it can be changed into a prime (10221200220017) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4542412 + ... + 6409048.
Almost surely, 210221200220010 is an apocalyptic number.
10221200220010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10221200220010 is a deficient number, since it is larger than the sum of its proper divisors (9898439595062).
10221200220010 is a wasteful number, since it uses less digits than its factorization.
10221200220010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1867307.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 10221200220010 its reverse (1002200212201), we get a palindrome (11223400432211).
The spelling of 10221200220010 in words is "ten trillion, two hundred twenty-one billion, two hundred million, two hundred twenty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •