Base | Representation |
---|---|
bin | 11101000110110110010… |
… | …10001101100111101001 |
3 | 10112121110100002110011122 |
4 | 32203123022031213221 |
5 | 112341210440101301 |
6 | 2043235513105025 |
7 | 132153432534344 |
oct | 16433312154751 |
9 | 3477410073148 |
10 | 1000109300201 |
11 | 356164699840 |
12 | 1419b26b8175 |
13 | 73404b1750b |
14 | 36596b7945b |
15 | 1b03615681b |
hex | e8db28d9e9 |
1000109300201 has 16 divisors (see below), whose sum is σ = 1117734666048. Its totient is φ = 886938796800.
The previous prime is 1000109300171. The next prime is 1000109300237. The reversal of 1000109300201 is 1020039010001.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1000109300201 is a prime.
It is a super-2 number, since 2×10001093002012 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1000109300201.
It is not an unprimeable number, because it can be changed into a prime (1000109305201) 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, 5536430 + ... + 5714216.
It is an arithmetic number, because the mean of its divisors is an integer number (69858416628).
Almost surely, 21000109300201 is an apocalyptic number.
1000109300201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1000109300201 is a deficient number, since it is larger than the sum of its proper divisors (117625365847).
1000109300201 is a wasteful number, since it uses less digits than its factorization.
1000109300201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 190312.
The product of its (nonzero) digits is 54, while the sum is 17.
The spelling of 1000109300201 in words is "one trillion, one hundred nine million, three hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •