Base | Representation |
---|---|
bin | 10001110010010000111… |
… | …010101101100001111100 |
3 | 11022211201100201200120000 |
4 | 101302100322231201330 |
5 | 130011032204201022 |
6 | 2333245530554300 |
7 | 154205206530126 |
oct | 21622072554174 |
9 | 4284640650500 |
10 | 1222202022012 |
11 | 4313731a6914 |
12 | 178a54b98990 |
13 | 8b33a25143a |
14 | 43225056216 |
15 | 21bd3e226ac |
hex | 11c90ead87c |
1222202022012 has 60 divisors (see below), whose sum is σ = 3201638655600. Its totient is φ = 406564069824.
The previous prime is 1222202021959. The next prime is 1222202022023. The reversal of 1222202022012 is 2102202022221.
It is a super-2 number, since 2×12222020220122 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 3715137 + ... + 4030712.
It is an arithmetic number, because the mean of its divisors is an integer number (53360644260).
Almost surely, 21222202022012 is an apocalyptic number.
1222202022012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1222202022012 is an abundant number, since it is smaller than the sum of its proper divisors (1979436633588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1222202022012 is a wasteful number, since it uses less digits than its factorization.
1222202022012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7746352 (or 7746341 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
Adding to 1222202022012 its reverse (2102202022221), we get a palindrome (3324404044233).
The spelling of 1222202022012 in words is "one trillion, two hundred twenty-two billion, two hundred two million, twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •