Base | Representation |
---|---|
bin | 10110101111010110101100… |
… | …000011001011011111010001 |
3 | 111010002222101111002120200122 |
4 | 112233112230003023133101 |
5 | 101102040414200031001 |
6 | 552412302213400025 |
7 | 30031366524451301 |
oct | 2657265403133721 |
9 | 433088344076618 |
10 | 100011200002001 |
11 | 2995956a129482 |
12 | b272a10639015 |
13 | 43a6028628772 |
14 | 1a9a7d44a5601 |
15 | b867c2bb8b1b |
hex | 5af5ac0cb7d1 |
100011200002001 has 8 divisors (see below), whose sum is σ = 102139299799680. Its totient is φ = 97883108617968.
The previous prime is 100011200001919. The next prime is 100011200002037. The reversal of 100011200002001 is 100200002110001.
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 100011200002001 - 226 = 100011132893137 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 100011200002001.
It is not an unprimeable number, because it can be changed into a prime (100011200302001) 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, 25827515 + ... + 29446271.
It is an arithmetic number, because the mean of its divisors is an integer number (12767412474960).
Almost surely, 2100011200002001 is an apocalyptic number.
It is an amenable number.
100011200002001 is a deficient number, since it is larger than the sum of its proper divisors (2128099797679).
100011200002001 is an equidigital number, since it uses as much as digits as its factorization.
100011200002001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4206823.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 100011200002001 its reverse (100200002110001), we get a palindrome (200211202112002).
The spelling of 100011200002001 in words is "one hundred trillion, eleven billion, two hundred million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •