Base | Representation |
---|---|
bin | 101110101010100001… |
… | …0101101000011100001 |
3 | 100120122212201021021022 |
4 | 1131111002231003201 |
5 | 3120213010120001 |
6 | 114011501535225 |
7 | 10145215421111 |
oct | 1352502550341 |
9 | 316585637238 |
10 | 100211020001 |
11 | 395545655a4 |
12 | 17508574515 |
13 | 95b0454951 |
14 | 4bc90b1041 |
15 | 2917a1e11b |
hex | 17550ad0e1 |
100211020001 has 8 divisors (see below), whose sum is σ = 100675509000. Its totient is φ = 99746933760.
The previous prime is 100211019973. The next prime is 100211020067. The reversal of 100211020001 is 100020112001.
It can be written as a sum of positive squares in 4 ways, for example, as 76471606225 + 23739413776 = 276535^2 + 154076^2 .
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 100211020001 - 210 = 100211018977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100211020201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 403925 + ... + 602973.
It is an arithmetic number, because the mean of its divisors is an integer number (12584438625).
Almost surely, 2100211020001 is an apocalyptic number.
It is an amenable number.
100211020001 is a deficient number, since it is larger than the sum of its proper divisors (464488999).
100211020001 is a wasteful number, since it uses less digits than its factorization.
100211020001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201379.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 100211020001 its reverse (100020112001), we get a palindrome (200231132002).
The spelling of 100211020001 in words is "one hundred billion, two hundred eleven million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •