Base | Representation |
---|---|
bin | 111100101011100110… |
… | …1010000011110000011 |
3 | 110110100200020011210122 |
4 | 1321113031100132003 |
5 | 4113334400041003 |
6 | 135510424450455 |
7 | 12262153450613 |
oct | 1712715203603 |
9 | 413320204718 |
10 | 130312112003 |
11 | 502a0876537 |
12 | 21309319a2b |
13 | c3997535a8 |
14 | 6442b12a43 |
15 | 35ca466238 |
hex | 1e57350783 |
130312112003 has 4 divisors (see below), whose sum is σ = 131465316648. Its totient is φ = 129158907360.
The previous prime is 130312111999. The next prime is 130312112039. The reversal of 130312112003 is 300211213031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 300211213031 = 43 ⋅6981656117.
It is a cyclic number.
It is not a de Polignac number, because 130312112003 - 22 = 130312111999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130312112053) 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, 576602153 + ... + 576602378.
It is an arithmetic number, because the mean of its divisors is an integer number (32866329162).
Almost surely, 2130312112003 is an apocalyptic number.
130312112003 is a deficient number, since it is larger than the sum of its proper divisors (1153204645).
130312112003 is a wasteful number, since it uses less digits than its factorization.
130312112003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1153204644.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 130312112003 its reverse (300211213031), we get a palindrome (430523325034).
The spelling of 130312112003 in words is "one hundred thirty billion, three hundred twelve million, one hundred twelve thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •