Base | Representation |
---|---|
bin | 110000000011111101… |
… | …0100101011001001010 |
3 | 100212102000121111220222 |
4 | 1200013322211121022 |
5 | 3142334233410010 |
6 | 115225343350042 |
7 | 10312455431162 |
oct | 1400772453112 |
9 | 325360544828 |
10 | 103212013130 |
11 | 3a854544106 |
12 | 180055b2322 |
13 | 996b0c6225 |
14 | 4dd18955a2 |
15 | 2a4120c355 |
hex | 1807ea564a |
103212013130 has 32 divisors (see below), whose sum is σ = 197237448144. Its totient is φ = 38752091136.
The previous prime is 103212013109. The next prime is 103212013133. The reversal of 103212013130 is 31310212301.
It can be written as a sum of positive squares in 8 ways, for example, as 41751157561 + 61460855569 = 204331^2 + 247913^2 .
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a junction number, because it is equal to n+sod(n) for n = 103212013099 and 103212013108.
It is not an unprimeable number, because it can be changed into a prime (103212013133) 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 15 ways as a sum of consecutive naturals, for example, 750437 + ... + 877256.
Almost surely, 2103212013130 is an apocalyptic number.
103212013130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103212013130 is a deficient number, since it is larger than the sum of its proper divisors (94025435014).
103212013130 is a wasteful number, since it uses less digits than its factorization.
103212013130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1628090.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 103212013130 its reverse (31310212301), we get a palindrome (134522225431).
The spelling of 103212013130 in words is "one hundred three billion, two hundred twelve million, thirteen thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •