Base | Representation |
---|---|
bin | 11101000110101001111… |
… | …100110111111111000101 |
3 | 21002012101012201210102221 |
4 | 131012221330313333011 |
5 | 230232010320200401 |
6 | 4130443054532341 |
7 | 264332065565620 |
oct | 35065174677705 |
9 | 7065335653387 |
10 | 2000011100101 |
11 | 701222142523 |
12 | 2837478070b1 |
13 | 1167a594c891 |
14 | 6cb3013cdb7 |
15 | 37058e717a1 |
hex | 1d1a9f37fc5 |
2000011100101 has 8 divisors (see below), whose sum is σ = 2306696944640. Its totient is φ = 1698567748848.
The previous prime is 2000011100081. The next prime is 2000011100179. The reversal of 2000011100101 is 1010011100002.
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 2000011100101 - 29 = 2000011099589 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000011104101) 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, 1310622501 + ... + 1310624026.
It is an arithmetic number, because the mean of its divisors is an integer number (288337118080).
Almost surely, 22000011100101 is an apocalyptic number.
It is an amenable number.
2000011100101 is a deficient number, since it is larger than the sum of its proper divisors (306685844539).
2000011100101 is a wasteful number, since it uses less digits than its factorization.
2000011100101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2621246643.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 2000011100101 its reverse (1010011100002), we get a palindrome (3010022200103).
Subtracting from 2000011100101 its reverse (1010011100002), we obtain a palindrome (990000000099).
The spelling of 2000011100101 in words is "two trillion, eleven million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •