Base | Representation |
---|---|
bin | 1010111011001000110101… |
… | …1101111101011101111110 |
3 | 1120112020202100110012010111 |
4 | 2232302031131331131332 |
5 | 3033242214103013042 |
6 | 41313454000300234 |
7 | 2346526206323305 |
oct | 256621535753576 |
9 | 46466670405114 |
10 | 12011102001022 |
11 | 3910974a50563 |
12 | 141b9b991167a |
13 | 6918467ab767 |
14 | 2d74aa24143c |
15 | 15c68290c517 |
hex | aec8d77d77e |
12011102001022 has 16 divisors (see below), whose sum is σ = 18954896636592. Its totient is φ = 5700720790080.
The previous prime is 12011102001007. The next prime is 12011102001023. The reversal of 12011102001022 is 22010020111021.
It is a junction number, because it is equal to n+sod(n) for n = 12011102000993 and 12011102001011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12011102001023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1979413908 + ... + 1979419975.
It is an arithmetic number, because the mean of its divisors is an integer number (1184681039787).
Almost surely, 212011102001022 is an apocalyptic number.
12011102001022 is a deficient number, since it is larger than the sum of its proper divisors (6943794635570).
12011102001022 is a wasteful number, since it uses less digits than its factorization.
12011102001022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3958833963.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 12011102001022 its reverse (22010020111021), we get a palindrome (34021122112043).
The spelling of 12011102001022 in words is "twelve trillion, eleven billion, one hundred two million, one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •