Base | Representation |
---|---|
bin | 1011000000111001010110… |
… | …0011110100000101111110 |
3 | 1120212201002020212211220012 |
4 | 2300032111203310011332 |
5 | 3041402311113013042 |
6 | 41431133423223222 |
7 | 2356630430414621 |
oct | 260162543640576 |
9 | 46781066784805 |
10 | 12110022001022 |
11 | 3949916791680 |
12 | 1437005a47b12 |
13 | 69ac7c62093a |
14 | 2dc1b1a8bdb8 |
15 | 160021e11e82 |
hex | b03958f417e |
12110022001022 has 16 divisors (see below), whose sum is σ = 19816475945472. Its totient is φ = 5504534258520.
The previous prime is 12110022001013. The next prime is 12110022001043. The reversal of 12110022001022 is 22010022001121.
12110022001022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 12110022000988 and 12110022001006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5757833 + ... + 7574475.
It is an arithmetic number, because the mean of its divisors is an integer number (1238529746592).
Almost surely, 212110022001022 is an apocalyptic number.
12110022001022 is a deficient number, since it is larger than the sum of its proper divisors (7706453944450).
12110022001022 is a wasteful number, since it uses less digits than its factorization.
12110022001022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2119663.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 12110022001022 its reverse (22010022001121), we get a palindrome (34120044002143).
Subtracting 12110022001022 from its reverse (22010022001121), we obtain a palindrome (9900000000099).
It can be divided in two parts, 121100 and 22001022, that added together give a palindrome (22122122).
The spelling of 12110022001022 in words is "twelve trillion, one hundred ten billion, twenty-two million, one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •