Base | Representation |
---|---|
bin | 10000001010111001011… |
… | …001011010111000001110 |
3 | 10221020020021102221102020 |
4 | 100022321121122320032 |
5 | 121201230233323042 |
6 | 2210252253511010 |
7 | 143165604151221 |
oct | 20127131327016 |
9 | 3836207387366 |
10 | 1111212011022 |
11 | 399298235903 |
12 | 15b43a7a2466 |
13 | 80a2c903c19 |
14 | 3bad65a55b8 |
15 | 1dd89e6d3ec |
hex | 102b965ae0e |
1111212011022 has 8 divisors (see below), whose sum is σ = 2222424022056. Its totient is φ = 370404003672.
The previous prime is 1111212011011. The next prime is 1111212011047. The reversal of 1111212011022 is 2201102121111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
1111212011022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 1111212010992 and 1111212011010.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 92601000913 + ... + 92601000924.
It is an arithmetic number, because the mean of its divisors is an integer number (277803002757).
Almost surely, 21111212011022 is an apocalyptic number.
1111212011022 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.
1111212011022 is a wasteful number, since it uses less digits than its factorization.
1111212011022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185202001842.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1111212011022 its reverse (2201102121111), we get a palindrome (3312314132133).
The spelling of 1111212011022 in words is "one trillion, one hundred eleven billion, two hundred twelve million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •