Base | Representation |
---|---|
bin | 101110100100010010… |
… | …1101111001110001101 |
3 | 100120010022121001001112 |
4 | 1131020211233032031 |
5 | 3114301014200414 |
6 | 113535040021405 |
7 | 10140100553162 |
oct | 1351045571615 |
9 | 316108531045 |
10 | 100002100109 |
11 | 3945763aa2a |
12 | 1746a601865 |
13 | 9579096602 |
14 | 4ba944a069 |
15 | 2904501d3e |
hex | 174896f38d |
100002100109 has 4 divisors (see below), whose sum is σ = 105884576604. Its totient is φ = 94119623616.
The previous prime is 100002100073. The next prime is 100002100117. The reversal of 100002100109 is 901001200001.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 901001200001 = 7 ⋅128714457143.
It can be written as a sum of positive squares in 2 ways, for example, as 31124722084 + 68877378025 = 176422^2 + 262445^2 .
It is not a de Polignac number, because 100002100109 - 220 = 100001051533 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100002100093 and 100002100102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100002100129) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2941238222 + ... + 2941238255.
It is an arithmetic number, because the mean of its divisors is an integer number (26471144151).
Almost surely, 2100002100109 is an apocalyptic number.
It is an amenable number.
100002100109 is a deficient number, since it is larger than the sum of its proper divisors (5882476495).
100002100109 is an equidigital number, since it uses as much as digits as its factorization.
100002100109 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5882476494.
The product of its (nonzero) digits is 18, while the sum is 14.
The spelling of 100002100109 in words is "one hundred billion, two million, one hundred thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •