Base | Representation |
---|---|
bin | 10110101111001100010000… |
… | …011110101100000101001101 |
3 | 111010001220110221101012200200 |
4 | 112233030100132230011031 |
5 | 101101400000002024401 |
6 | 552403211003244113 |
7 | 30030522136340610 |
oct | 2657142036540515 |
9 | 433056427335620 |
10 | 100000000033101 |
11 | 2995484202a033 |
12 | b270805819639 |
13 | 43a4c6215802c |
14 | 1a9a050c20177 |
15 | b863697c9686 |
hex | 5af3107ac14d |
100000000033101 has 144 divisors (see below), whose sum is σ = 174830537531520. Its totient is φ = 53947529798400.
The previous prime is 100000000033099. The next prime is 100000000033123. The reversal of 100000000033101 is 101330000000001.
It is not a de Polignac number, because 100000000033101 - 21 = 100000000033099 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100000000033201) 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 143 ways as a sum of consecutive naturals, for example, 8114900926 + ... + 8114913248.
It is an arithmetic number, because the mean of its divisors is an integer number (1214100955080).
Almost surely, 2100000000033101 is an apocalyptic number.
It is an amenable number.
100000000033101 is a deficient number, since it is larger than the sum of its proper divisors (74830537498419).
100000000033101 is a wasteful number, since it uses less digits than its factorization.
100000000033101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13584 (or 13562 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 9.
Adding to 100000000033101 its reverse (101330000000001), we get a palindrome (201330000033102).
The spelling of 100000000033101 in words is "one hundred trillion, thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •