Base | Representation |
---|---|
bin | 10110110000101011010000… |
… | …001101011111111001000001 |
3 | 111010102122202120012012111120 |
4 | 112300223100031133321001 |
5 | 101110032344224000001 |
6 | 552522120250102453 |
7 | 30041062621266060 |
oct | 2660532015377101 |
9 | 433378676165446 |
10 | 100102001000001 |
11 | 29994024a02190 |
12 | b28853171aa29 |
13 | 43b176938cc50 |
14 | 1aa0d6990c1d7 |
15 | b88d39518236 |
hex | 5b0ad035fe41 |
100102001000001 has 128 divisors (see below), whose sum is σ = 180444389658624. Its totient is φ = 47669231877120.
The previous prime is 100102000999997. The next prime is 100102001000009. The reversal of 100102001000001 is 100000100201001.
It is not a de Polignac number, because 100102001000001 - 22 = 100102000999997 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100102001000009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 458626171 + ... + 458844383.
It is an arithmetic number, because the mean of its divisors is an integer number (1409721794208).
Almost surely, 2100102001000001 is an apocalyptic number.
100102001000001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100102001000001 is a deficient number, since it is larger than the sum of its proper divisors (80342388658623).
100102001000001 is a wasteful number, since it uses less digits than its factorization.
100102001000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219303.
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 100102001000001 its reverse (100000100201001), we get a palindrome (200102101201002).
The spelling of 100102001000001 in words is "one hundred trillion, one hundred two billion, one million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •