Base | Representation |
---|---|
bin | 100111000111000… |
… | …0010010000100000 |
3 | 10101110022212001221 |
4 | 1032032002100200 |
5 | 10141422131422 |
6 | 334115104424 |
7 | 44343245452 |
oct | 11616022040 |
9 | 3343285057 |
10 | 1312302112 |
11 | 613840000 |
12 | 3075a2114 |
13 | 17bb54634 |
14 | c64042d2 |
15 | 7a3203c7 |
hex | 4e382420 |
1312302112 has 60 divisors (see below), whose sum is σ = 2842951230. Its totient is φ = 596288000.
The previous prime is 1312302067. The next prime is 1312302139. The reversal of 1312302112 is 2112032131.
It can be written as a sum of positive squares in only one way, i.e., 1115292816 + 197009296 = 33396^2 + 14036^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 467112 + ... + 469912.
Almost surely, 21312302112 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 1312302112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1421475615).
1312302112 is an abundant number, since it is smaller than the sum of its proper divisors (1530649118).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1312302112 is an frugal number, since it uses more digits than its factorization.
1312302112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2855 (or 2814 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1312302112 is about 36225.7106486539. The cubic root of 1312302112 is about 1094.8247565375.
Adding to 1312302112 its reverse (2112032131), we get a palindrome (3424334243).
The spelling of 1312302112 in words is "one billion, three hundred twelve million, three hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •