Base | Representation |
---|---|
bin | 101101011110100010110000… |
… | …100110110010111001100101 |
3 | 222020011212100111001221221120 |
4 | 231132202300212302321211 |
5 | 202203440012000000401 |
6 | 1545215441313404153 |
7 | 60062214014630613 |
oct | 5536426046627145 |
9 | 866155314057846 |
10 | 200011000000101 |
11 | 58803209251224 |
12 | 1a52357b269659 |
13 | 877ac581b6594 |
14 | 37568268d46b3 |
15 | 181cb29b2d836 |
hex | b5e8b09b2e65 |
200011000000101 has 8 divisors (see below), whose sum is σ = 278276173913280. Its totient is φ = 127543246376832.
The previous prime is 200011000000073. The next prime is 200011000000117. The reversal of 200011000000101 is 101000000110002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200011000000101 - 229 = 200010463129189 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200011000000101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200011008000101) 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, 1449355072396 + ... + 1449355072533.
It is an arithmetic number, because the mean of its divisors is an integer number (34784521739160).
Almost surely, 2200011000000101 is an apocalyptic number.
It is an amenable number.
200011000000101 is a deficient number, since it is larger than the sum of its proper divisors (78265173913179).
200011000000101 is a wasteful number, since it uses less digits than its factorization.
200011000000101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2898710144955.
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 200011000000101 its reverse (101000000110002), we get a palindrome (301011000110103).
The spelling of 200011000000101 in words is "two hundred trillion, eleven billion, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •