Base | Representation |
---|---|
bin | 10110110000101010010101… |
… | …110011000110000101000001 |
3 | 111010102120020021011001020021 |
4 | 112300222111303012011001 |
5 | 101110023342334000001 |
6 | 552521435121213441 |
7 | 30041026421364160 |
oct | 2660522563060501 |
9 | 433376207131207 |
10 | 100101021000001 |
11 | 299936717a972a |
12 | b2882b9491281 |
13 | 43b16413361a8 |
14 | 1aa0cb56c93d7 |
15 | b88ccd487ba1 |
hex | 5b0a95cc6141 |
100101021000001 has 8 divisors (see below), whose sum is σ = 114403507553984. Its totient is φ = 85799119620240.
The previous prime is 100101020999989. The next prime is 100101021000047. The reversal of 100101021000001 is 100000120101001.
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 100101021000001 - 221 = 100101018902849 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 not an unprimeable number, because it can be changed into a prime (100101021000601) 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, 145926930 + ... + 146611291.
It is an arithmetic number, because the mean of its divisors is an integer number (14300438444248).
Almost surely, 2100101021000001 is an apocalyptic number.
It is an amenable number.
100101021000001 is a deficient number, since it is larger than the sum of its proper divisors (14302486553983).
100101021000001 is an equidigital number, since it uses as much as digits as its factorization.
100101021000001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 292587111.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 100101021000001 its reverse (100000120101001), we get a palindrome (200101141101002).
The spelling of 100101021000001 in words is "one hundred trillion, one hundred one billion, twenty-one million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •