Base | Representation |
---|---|
bin | 11110101110001110101… |
… | …000110010100110010110 |
3 | 21110211102200122212020020 |
4 | 132232032220302212112 |
5 | 234042240313000042 |
6 | 4253514302250010 |
7 | 305350022622552 |
oct | 36561650624626 |
9 | 7424380585206 |
10 | 2111222000022 |
11 | 744400863673 |
12 | 2a1203b86906 |
13 | 124119c892c5 |
14 | 7428008c862 |
15 | 39db75093ec |
hex | 1eb8ea32996 |
2111222000022 has 8 divisors (see below), whose sum is σ = 4222444000056. Its totient is φ = 703740666672.
The previous prime is 2111221999967. The next prime is 2111222000117. The reversal of 2111222000022 is 2200002221112.
It is a sphenic number, since it is the product of 3 distinct primes.
2111222000022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 2111221999965 and 2111222000010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 175935166663 + ... + 175935166674.
It is an arithmetic number, because the mean of its divisors is an integer number (527805500007).
Almost surely, 22111222000022 is an apocalyptic number.
2111222000022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2111222000022 is a wasteful number, since it uses less digits than its factorization.
2111222000022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 351870333342.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 2111222000022 its reverse (2200002221112), we get a palindrome (4311224221134).
It can be divided in two parts, 21112 and 22000022, that multiplied together give a palindrome (464464464464).
The spelling of 2111222000022 in words is "two trillion, one hundred eleven billion, two hundred twenty-two million, twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •