Base | Representation |
---|---|
bin | 101110100100100111… |
… | …1010111000001001101 |
3 | 100120011002010101000101 |
4 | 1131021033113001031 |
5 | 3114311312323041 |
6 | 113540105531101 |
7 | 10140262365340 |
oct | 1351117270115 |
9 | 316132111011 |
10 | 100013011021 |
11 | 39462812510 |
12 | 174721a3a91 |
13 | 957b416981 |
14 | 4baaa8a457 |
15 | 2905459b31 |
hex | 17493d704d |
100013011021 has 32 divisors (see below), whose sum is σ = 125996083200. Its totient is φ = 77118022080.
The previous prime is 100013011001. The next prime is 100013011057. The reversal of 100013011021 is 120110310001.
It is not a de Polignac number, because 100013011021 - 25 = 100013010989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100013010989 and 100013011007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100013011001) 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 31 ways as a sum of consecutive naturals, for example, 12836395 + ... + 12844183.
It is an arithmetic number, because the mean of its divisors is an integer number (3937377600).
Almost surely, 2100013011021 is an apocalyptic number.
100013011021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100013011021 is a deficient number, since it is larger than the sum of its proper divisors (25983072179).
100013011021 is a wasteful number, since it uses less digits than its factorization.
100013011021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9529.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 100013011021 its reverse (120110310001), we get a palindrome (220123321022).
The spelling of 100013011021 in words is "one hundred billion, thirteen million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •