Base | Representation |
---|---|
bin | 111100110111001… |
… | …111001111100000 |
3 | 2122011101221010120 |
4 | 330313033033200 |
5 | 4042401111222 |
6 | 245154000240 |
7 | 34206214512 |
oct | 7467171740 |
9 | 2564357116 |
10 | 1021113312 |
11 | 4844345aa |
12 | 245b76080 |
13 | 13372027b |
14 | 99885bb2 |
15 | 5e9a215c |
hex | 3cdcf3e0 |
1021113312 has 48 divisors (see below), whose sum is σ = 2682691200. Its totient is φ = 340083072.
The previous prime is 1021113307. The next prime is 1021113341. The reversal of 1021113312 is 2133111201.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (48).
It is a junction number, because it is equal to n+sod(n) for n = 1021113291 and 1021113300.
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, 130503 + ... + 138105.
It is an arithmetic number, because the mean of its divisors is an integer number (55889400).
Almost surely, 21021113312 is an apocalyptic number.
1021113312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1021113312 is an abundant number, since it is smaller than the sum of its proper divisors (1661577888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1021113312 is a wasteful number, since it uses less digits than its factorization.
1021113312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9015 (or 9007 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
The square root of 1021113312 is about 31954.8636673668. The cubic root of 1021113312 is about 1006.9888133683.
Adding to 1021113312 its reverse (2133111201), we get a palindrome (3154224513).
The spelling of 1021113312 in words is "one billion, twenty-one million, one hundred thirteen thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •