Base | Representation |
---|---|
bin | 11101101111111111110… |
… | …00011000110101010100 |
3 | 10121201110220001111112220 |
4 | 32313333320120311110 |
5 | 113221431224033022 |
6 | 2101331534142340 |
7 | 133565034342315 |
oct | 16677770306524 |
9 | 3551426044486 |
10 | 1022200221012 |
11 | 364570415593 |
12 | 1461389519b0 |
13 | 755157515a9 |
14 | 37690a2660c |
15 | 1b8ca74485c |
hex | edffe18d54 |
1022200221012 has 24 divisors (see below), whose sum is σ = 2385789747936. Its totient is φ = 340639707168.
The previous prime is 1022200220959. The next prime is 1022200221017. The reversal of 1022200221012 is 2101220022201.
It is a junction number, because it is equal to n+sod(n) for n = 1022200220982 and 1022200221000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022200221017) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11667018 + ... + 11754305.
It is an arithmetic number, because the mean of its divisors is an integer number (99407906164).
Almost surely, 21022200221012 is an apocalyptic number.
1022200221012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1022200221012 is an abundant number, since it is smaller than the sum of its proper divisors (1363589526924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022200221012 is a wasteful number, since it uses less digits than its factorization.
1022200221012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23424967 (or 23424965 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 1022200221012 its reverse (2101220022201), we get a palindrome (3123420243213).
The spelling of 1022200221012 in words is "one trillion, twenty-two billion, two hundred million, two hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.163 sec. • engine limits •