Base | Representation |
---|---|
bin | 100011110011010… |
… | …1001000101110000 |
3 | 10002201110222102012 |
4 | 1013212221011300 |
5 | 4430013441422 |
6 | 315112142052 |
7 | 41524661450 |
oct | 10746510560 |
9 | 3081428365 |
10 | 1201312112 |
11 | 567122630 |
12 | 296397928 |
13 | 161b63790 |
14 | b5791d60 |
15 | 706e94e2 |
hex | 479a9170 |
1201312112 has 160 divisors (see below), whose sum is σ = 3158797824. Its totient is φ = 427392000.
The previous prime is 1201312109. The next prime is 1201312127. The reversal of 1201312112 is 2112131021.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1713362 + ... + 1714062.
Almost surely, 21201312112 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 1201312112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1579398912).
1201312112 is an abundant number, since it is smaller than the sum of its proper divisors (1957485712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1201312112 is a wasteful number, since it uses less digits than its factorization.
1201312112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 847 (or 841 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 14.
The square root of 1201312112 is about 34659.9496825948. The cubic root of 1201312112 is about 1063.0457411745.
Adding to 1201312112 its reverse (2112131021), we get a palindrome (3313443133).
It can be divided in two parts, 1201 and 312112, that added together give a palindrome (313313).
The spelling of 1201312112 in words is "one billion, two hundred one million, three hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •