Base | Representation |
---|---|
bin | 101111111101111100… |
… | …0011101110000111011 |
3 | 100211212221201211201011 |
4 | 1133323320131300323 |
5 | 3141431043143003 |
6 | 115153332334351 |
7 | 10304454444433 |
oct | 1377370356073 |
9 | 324787654634 |
10 | 103010131003 |
11 | 3a76059607a |
12 | 17b69a743b7 |
13 | 9938330350 |
14 | 4db2b432c3 |
15 | 2a2d63046d |
hex | 17fbe1dc3b |
103010131003 has 16 divisors (see below), whose sum is σ = 111633935616. Its totient is φ = 94487732640.
The previous prime is 103010131001. The next prime is 103010131033. The reversal of 103010131003 is 300131010301.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 103010131003 - 21 = 103010131001 is a prime.
It is a super-2 number, since 2×1030101310032 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103010131001) 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, 1745700 + ... + 1803742.
It is an arithmetic number, because the mean of its divisors is an integer number (6977120976).
Almost surely, 2103010131003 is an apocalyptic number.
103010131003 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
103010131003 is a deficient number, since it is larger than the sum of its proper divisors (8623804613).
103010131003 is a wasteful number, since it uses less digits than its factorization.
103010131003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58914.
The product of its (nonzero) digits is 27, while the sum is 13.
Adding to 103010131003 its reverse (300131010301), we get a palindrome (403141141304).
The spelling of 103010131003 in words is "one hundred three billion, ten million, one hundred thirty-one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •