Base | Representation |
---|---|
bin | 11101000110101001011… |
… | …01000101001010101101 |
3 | 10112121011210022020101010 |
4 | 32203110231011022231 |
5 | 112341000224000414 |
6 | 2043221043535433 |
7 | 132150646152546 |
oct | 16432455051255 |
9 | 3477153266333 |
10 | 1000001000109 |
11 | 356109549331 |
12 | 14198238a579 |
13 | 733b8558b17 |
14 | 365866274cd |
15 | 1b02b8b2959 |
hex | e8d4b452ad |
1000001000109 has 16 divisors (see below), whose sum is σ = 1370372681088. Its totient is φ = 648174693312.
The previous prime is 1000001000107. The next prime is 1000001000111. The reversal of 1000001000109 is 9010001000001.
1000001000109 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (1000001000107) and next prime (1000001000111).
It is not a de Polignac number, because 1000001000109 - 21 = 1000001000107 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1000001000094 and 1000001000103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000001000107) 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, 3143442 + ... + 3446915.
It is an arithmetic number, because the mean of its divisors is an integer number (85648292568).
Almost surely, 21000001000109 is an apocalyptic number.
It is an amenable number.
1000001000109 is a deficient number, since it is larger than the sum of its proper divisors (370371680979).
1000001000109 is a wasteful number, since it uses less digits than its factorization.
1000001000109 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6591764.
The product of its (nonzero) digits is 9, while the sum is 12.
The spelling of 1000001000109 in words is "one trillion, one million, one hundred nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •