Base | Representation |
---|---|
bin | 1001000101011000110… |
… | …01111101000010110111 |
3 | 1002211122212220111001000 |
4 | 10202230121331002313 |
5 | 20103220303130403 |
6 | 355220211534343 |
7 | 31356606221211 |
oct | 4425431750267 |
9 | 1084585814030 |
10 | 312130130103 |
11 | 110412359610 |
12 | 505ab8ba3b3 |
13 | 23583c2619c |
14 | 111701555b1 |
15 | 81bc5867a3 |
hex | 48ac67d0b7 |
312130130103 has 16 divisors (see below), whose sum is σ = 504452736000. Its totient is φ = 189169775640.
The previous prime is 312130130101. The next prime is 312130130159. The reversal of 312130130103 is 301031031213.
It is a happy number.
312130130103 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 312130130103 - 21 = 312130130101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312130130101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 525471303 + ... + 525471896.
It is an arithmetic number, because the mean of its divisors is an integer number (31528296000).
Almost surely, 2312130130103 is an apocalyptic number.
312130130103 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
312130130103 is a deficient number, since it is larger than the sum of its proper divisors (192322605897).
312130130103 is a wasteful number, since it uses less digits than its factorization.
312130130103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1050943219 (or 1050943213 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 312130130103 its reverse (301031031213), we get a palindrome (613161161316).
The spelling of 312130130103 in words is "three hundred twelve billion, one hundred thirty million, one hundred thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •