Base | Representation |
---|---|
bin | 1011000110001000100011… |
… | …0010101100101000010110 |
3 | 1121012022100010100002102220 |
4 | 2301202020302230220112 |
5 | 3044341101020041042 |
6 | 41540334213243210 |
7 | 2366264265634014 |
oct | 261421062545026 |
9 | 47168303302386 |
10 | 12200002112022 |
11 | 3983aa015887a |
12 | 1450538033506 |
13 | 6a65bc29b17a |
14 | 3026aa08d8b4 |
15 | 16253b6608ec |
hex | b1888caca16 |
12200002112022 has 8 divisors (see below), whose sum is σ = 24400004224056. Its totient is φ = 4066667370672.
The previous prime is 12200002111939. The next prime is 12200002112027. The reversal of 12200002112022 is 22021120000221.
It is a sphenic number, since it is the product of 3 distinct primes.
12200002112022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 12200002111992 and 12200002112010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12200002112027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1016666842663 + ... + 1016666842674.
It is an arithmetic number, because the mean of its divisors is an integer number (3050000528007).
Almost surely, 212200002112022 is an apocalyptic number.
12200002112022 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.
12200002112022 is a wasteful number, since it uses less digits than its factorization.
12200002112022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2033333685342.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 12200002112022 its reverse (22021120000221), we get a palindrome (34221122112243).
The spelling of 12200002112022 in words is "twelve trillion, two hundred billion, two million, one hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •