Base | Representation |
---|---|
bin | 101111111101111110… |
… | …0100101001100010011 |
3 | 100211220000202122211010 |
4 | 1133323330211030103 |
5 | 3141431332210003 |
6 | 115153411422003 |
7 | 10304466560262 |
oct | 1377374451423 |
9 | 324800678733 |
10 | 103011210003 |
11 | 3a761162809 |
12 | 17b6a2b4903 |
13 | 993861a500 |
14 | 4db2d445d9 |
15 | 2a2d795003 |
hex | 17fbf25313 |
103011210003 has 24 divisors (see below), whose sum is σ = 155192620032. Its totient is φ = 60635354208.
The previous prime is 103011209953. The next prime is 103011210007. The reversal of 103011210003 is 300012110301.
It is not a de Polignac number, because 103011210003 - 220 = 103010161427 is a prime.
It is a super-2 number, since 2×1030112100032 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103011210007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4405251 + ... + 4428572.
It is an arithmetic number, because the mean of its divisors is an integer number (6466359168).
Almost surely, 2103011210003 is an apocalyptic number.
103011210003 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
103011210003 is a deficient number, since it is larger than the sum of its proper divisors (52181410029).
103011210003 is a wasteful number, since it uses less digits than its factorization.
103011210003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8833875 (or 8833862 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 103011210003 its reverse (300012110301), we get a palindrome (403023320304).
The spelling of 103011210003 in words is "one hundred three billion, eleven million, two hundred ten thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •