Base | Representation |
---|---|
bin | 110000000011111001… |
… | …0111101000111001011 |
3 | 100212101212211220102221 |
4 | 1200013302331013023 |
5 | 3142333230410011 |
6 | 115225232434511 |
7 | 10312432431241 |
oct | 1400762750713 |
9 | 325355756387 |
10 | 103210013131 |
11 | 3a8533a8515 |
12 | 180049a8a37 |
13 | 996a875ab4 |
14 | 4dd14d4791 |
15 | 2a40e64971 |
hex | 1807cbd1cb |
103210013131 has 8 divisors (see below), whose sum is σ = 109284152400. Its totient is φ = 97136203008.
The previous prime is 103210013129. The next prime is 103210013143. The reversal of 103210013131 is 131310012301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103210013131 - 21 = 103210013129 is a prime.
It is a super-2 number, since 2×1032100131312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103210013161) 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 7 ways as a sum of consecutive naturals, for example, 895080 + ... + 1003786.
It is an arithmetic number, because the mean of its divisors is an integer number (13660519050).
Almost surely, 2103210013131 is an apocalyptic number.
103210013131 is a deficient number, since it is larger than the sum of its proper divisors (6074139269).
103210013131 is a wasteful number, since it uses less digits than its factorization.
103210013131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164573.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 103210013131 its reverse (131310012301), we get a palindrome (234520025432).
The spelling of 103210013131 in words is "one hundred three billion, two hundred ten million, thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •