Base | Representation |
---|---|
bin | 1101100111101010… |
… | …11111001000110100 |
3 | 200212121000200101210 |
4 | 12303311133020310 |
5 | 104433400011012 |
6 | 3205323521420 |
7 | 346125624225 |
oct | 66365371064 |
9 | 20777020353 |
10 | 7312110132 |
11 | 311254a628 |
12 | 1500989270 |
13 | 8c6b83bb2 |
14 | 4d51a324c |
15 | 2cbe1b23c |
hex | 1b3d5f234 |
7312110132 has 12 divisors (see below), whose sum is σ = 17061590336. Its totient is φ = 2437370040.
The previous prime is 7312110131. The next prime is 7312110161. The reversal of 7312110132 is 2310112137.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 7312110099 and 7312110108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (7312110131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 304671244 + ... + 304671267.
Almost surely, 27312110132 is an apocalyptic number.
It is an amenable number.
7312110132 is an abundant number, since it is smaller than the sum of its proper divisors (9749480204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
7312110132 is a wasteful number, since it uses less digits than its factorization.
7312110132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 609342518 (or 609342516 counting only the distinct ones).
The product of its (nonzero) digits is 252, while the sum is 21.
The square root of 7312110132 is about 85510.8772730113. The cubic root of 7312110132 is about 1940.9495238475.
Adding to 7312110132 its reverse (2310112137), we get a palindrome (9622222269).
The spelling of 7312110132 in words is "seven billion, three hundred twelve million, one hundred ten thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •