Base | Representation |
---|---|
bin | 110000000000111110… |
… | …1100100010110101101 |
3 | 100212011001200000210100 |
4 | 1200001331210112231 |
5 | 3142133201211023 |
6 | 115211414501313 |
7 | 10310133442452 |
oct | 1400175442655 |
9 | 325131600710 |
10 | 103112132013 |
11 | 3a803123a30 |
12 | 17b98064839 |
13 | 99534c4887 |
14 | 4dc24d5829 |
15 | 2a3757cc43 |
hex | 1801f645ad |
103112132013 has 24 divisors (see below), whose sum is σ = 162711615456. Its totient is φ = 62403012000.
The previous prime is 103112131981. The next prime is 103112132033. The reversal of 103112132013 is 310231211301.
103112132013 is a `hidden beast` number, since 1 + 0 + 311 + 21 + 320 + 13 = 666.
It is not a de Polignac number, because 103112132013 - 25 = 103112131981 is a prime.
It is a super-2 number, since 2×1031121320132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103112132033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 673495 + ... + 812292.
It is an arithmetic number, because the mean of its divisors is an integer number (6779650644).
Almost surely, 2103112132013 is an apocalyptic number.
It is an amenable number.
103112132013 is a deficient number, since it is larger than the sum of its proper divisors (59599483443).
103112132013 is a wasteful number, since it uses less digits than its factorization.
103112132013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1486505 (or 1486502 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 103112132013 its reverse (310231211301), we get a palindrome (413343343314).
The spelling of 103112132013 in words is "one hundred three billion, one hundred twelve million, one hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •