Base | Representation |
---|---|
bin | 1010000011110101011100… |
… | …00100100111111001110000 |
3 | 2220022211202100122020000020 |
4 | 11001322232010213321300 |
5 | 10344421330004201000 |
6 | 115014412445523440 |
7 | 4442155555425126 |
oct | 501725604477160 |
9 | 86284670566006 |
10 | 22122002022000 |
11 | 7059985470781 |
12 | 2593485873580 |
13 | c46132736c6a |
14 | 5669d3cb7916 |
15 | 28569d97aba0 |
hex | 141eae127e70 |
22122002022000 has 80 divisors (see below), whose sum is σ = 71321334538272. Its totient is φ = 5899200537600.
The previous prime is 22122002021939. The next prime is 22122002022011. The reversal of 22122002022000 is 22020022122.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×221220020220002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1843494169 + ... + 1843506168.
Almost surely, 222122002022000 is an apocalyptic number.
22122002022000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22122002022000 is an abundant number, since it is smaller than the sum of its proper divisors (49199332516272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22122002022000 is a wasteful number, since it uses less digits than its factorization.
22122002022000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3687000363 (or 3687000347 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 15.
Adding to 22122002022000 its reverse (22020022122), we get a palindrome (22144022044122).
The spelling of 22122002022000 in words is "twenty-two trillion, one hundred twenty-two billion, two million, twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •