Base | Representation |
---|---|
bin | 1001001001101000100011… |
… | …11010000011010001101000 |
3 | 2122020122222021010012012202 |
4 | 10210310101322003101220 |
5 | 10114140302341242300 |
6 | 110444004332155332 |
7 | 4144532265465023 |
oct | 444642172032150 |
9 | 78218867105182 |
10 | 20122222212200 |
11 | 6458871943069 |
12 | 230b9a3608b48 |
13 | b2c6959a8a64 |
14 | 4d7cc67841ba |
15 | 24d659e94ad5 |
hex | 124d11e83468 |
20122222212200 has 24 divisors (see below), whose sum is σ = 46784166643830. Its totient is φ = 8048888884800.
The previous prime is 20122222212181. The next prime is 20122222212233. The reversal of 20122222212200 is 221222222102.
It can be written as a sum of positive squares in 3 ways, for example, as 16129075274404 + 3993146937796 = 4016102^2 + 1998286^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 50305555331 + ... + 50305555730.
Almost surely, 220122222212200 is an apocalyptic number.
20122222212200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20122222212200 is an abundant number, since it is smaller than the sum of its proper divisors (26661944431630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20122222212200 is a wasteful number, since it uses less digits than its factorization.
20122222212200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100611111077 (or 100611111068 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 20.
Adding to 20122222212200 its reverse (221222222102), we get a palindrome (20343444434302).
The spelling of 20122222212200 in words is "twenty trillion, one hundred twenty-two billion, two hundred twenty-two million, two hundred twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •