Base | Representation |
---|---|
bin | 11101011011001011001… |
… | …11010010010100000000 |
3 | 10120122121212110201200102 |
4 | 32231211213102110000 |
5 | 113031033130041000 |
6 | 2052242424341532 |
7 | 133021033105235 |
oct | 16554547222400 |
9 | 3518555421612 |
10 | 1011022112000 |
11 | 35a85469686a |
12 | 143b393148a8 |
13 | 744539659c4 |
14 | 36d1023178c |
15 | 1b4742223d5 |
hex | eb659d2500 |
1011022112000 has 144 divisors (see below), whose sum is σ = 2561275080000. Its totient is φ = 397553715200.
The previous prime is 1011022111999. The next prime is 1011022112011. The reversal of 1011022112000 is 2112201101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1620251 + ... + 2155749.
It is an arithmetic number, because the mean of its divisors is an integer number (17786632500).
Almost surely, 21011022112000 is an apocalyptic number.
1011022112000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1011022112000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1280637540000).
1011022112000 is an abundant number, since it is smaller than the sum of its proper divisors (1550252968000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011022112000 is an frugal number, since it uses more digits than its factorization.
1011022112000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 535589 (or 535565 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1011022112000 its reverse (2112201101), we get a palindrome (1013134313101).
The spelling of 1011022112000 in words is "one trillion, eleven billion, twenty-two million, one hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •