Base | Representation |
---|---|
bin | 1001000110001100101110… |
… | …1111001100000011110111 |
3 | 1022102012011200112102121102 |
4 | 2101203023233030003313 |
5 | 2302333301103310403 |
6 | 33134522514240315 |
7 | 2051425261212530 |
oct | 221431357140367 |
9 | 38365150472542 |
10 | 10002102010103 |
11 | 320695a915355 |
12 | 115658388609b |
13 | 57726a79b298 |
14 | 26816637d687 |
15 | 12529e755b88 |
hex | 918cbbcc0f7 |
10002102010103 has 16 divisors (see below), whose sum is σ = 11665839974400. Its totient is φ = 8397613594656.
The previous prime is 10002102010099. The next prime is 10002102010127. The reversal of 10002102010103 is 30101020120001.
It is a cyclic number.
It is not a de Polignac number, because 10002102010103 - 22 = 10002102010099 is a prime.
It is a super-2 number, since 2×100021020101032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002102010133) 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 15 ways as a sum of consecutive naturals, for example, 21982253 + ... + 22432646.
It is an arithmetic number, because the mean of its divisors is an integer number (729114998400).
Almost surely, 210002102010103 is an apocalyptic number.
10002102010103 is a deficient number, since it is larger than the sum of its proper divisors (1663737964297).
10002102010103 is an equidigital number, since it uses as much as digits as its factorization.
10002102010103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44415566.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 10002102010103 its reverse (30101020120001), we get a palindrome (40103122130104).
The spelling of 10002102010103 in words is "ten trillion, two billion, one hundred two million, ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •