Base | Representation |
---|---|
bin | 101110100100110111… |
… | …1110000100001100101 |
3 | 100120011200002212022220 |
4 | 1131021233300201211 |
5 | 3114321001112401 |
6 | 113541011542553 |
7 | 10140424520451 |
oct | 1351157604145 |
9 | 316150085286 |
10 | 100021504101 |
11 | 39467593492 |
12 | 17474bbaa59 |
13 | 95800cb66c |
14 | 4babc5b661 |
15 | 2906086336 |
hex | 1749bf0865 |
100021504101 has 4 divisors (see below), whose sum is σ = 133362005472. Its totient is φ = 66681002732.
The previous prime is 100021504097. The next prime is 100021504103. The reversal of 100021504101 is 101405120001.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 100021504101 - 22 = 100021504097 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100021504103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16670250681 + ... + 16670250686.
It is an arithmetic number, because the mean of its divisors is an integer number (33340501368).
Almost surely, 2100021504101 is an apocalyptic number.
It is an amenable number.
100021504101 is a deficient number, since it is larger than the sum of its proper divisors (33340501371).
100021504101 is an equidigital number, since it uses as much as digits as its factorization.
100021504101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33340501370.
The product of its (nonzero) digits is 40, while the sum is 15.
Adding to 100021504101 its reverse (101405120001), we get a palindrome (201426624102).
The spelling of 100021504101 in words is "one hundred billion, twenty-one million, five hundred four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •