Base | Representation |
---|---|
bin | 11101000111000001100… |
… | …00000100011011010111 |
3 | 10112121200212121111011110 |
4 | 32203200300010123113 |
5 | 112341403444010403 |
6 | 2043253103510103 |
7 | 132155652105531 |
oct | 16434060043327 |
9 | 3477625544143 |
10 | 1000203110103 |
11 | 35620264258a |
12 | 141a19bb8333 |
13 | 7341b3a1632 |
14 | 365a53d8851 |
15 | 1b03e4d7103 |
hex | e8e0c046d7 |
1000203110103 has 8 divisors (see below), whose sum is σ = 1333613973888. Its totient is φ = 666797159864.
The previous prime is 1000203110063. The next prime is 1000203110119. The reversal of 1000203110103 is 3010113020001.
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 1000203110103 - 28 = 1000203109847 is a prime.
It is a super-2 number, since 2×10002031101032 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000203110903) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 723801 + ... + 1588802.
It is an arithmetic number, because the mean of its divisors is an integer number (166701746736).
Almost surely, 21000203110103 is an apocalyptic number.
1000203110103 is a deficient number, since it is larger than the sum of its proper divisors (333410863785).
1000203110103 is a wasteful number, since it uses less digits than its factorization.
1000203110103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2456773.
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 1000203110103 its reverse (3010113020001), we get a palindrome (4010316130104).
It can be divided in two parts, 100020 and 3110103, that added together give a palindrome (3210123).
The spelling of 1000203110103 in words is "one trillion, two hundred three million, one hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •