Base | Representation |
---|---|
bin | 11101011011001011000… |
… | …00000100111100000100 |
3 | 10120122121201220201101021 |
4 | 32231211200010330010 |
5 | 113031032134102322 |
6 | 2052242320040524 |
7 | 133021011044530 |
oct | 16554540047404 |
9 | 3518551821337 |
10 | 1011020222212 |
11 | 35a853615a60 |
12 | 143b38763144 |
13 | 744534537a0 |
14 | 36d0dc9cbc0 |
15 | 1b473e9c4c7 |
hex | eb65804f04 |
1011020222212 has 96 divisors (see below), whose sum is σ = 2379940141824. Its totient is φ = 362930803200.
The previous prime is 1011020222203. The next prime is 1011020222297. The reversal of 1011020222212 is 2122220201101.
It is a happy number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1932798 + ... + 2399530.
It is an arithmetic number, because the mean of its divisors is an integer number (24791043144).
Almost surely, 21011020222212 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1011020222212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1189970070912).
1011020222212 is an abundant number, since it is smaller than the sum of its proper divisors (1368919919612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011020222212 is a wasteful number, since it uses less digits than its factorization.
1011020222212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 467309 (or 467307 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 1011020222212 its reverse (2122220201101), we get a palindrome (3133240423313).
The spelling of 1011020222212 in words is "one trillion, eleven billion, twenty million, two hundred twenty-two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •