Base | Representation |
---|---|
bin | 101110100100100100… |
… | …0000100011101001101 |
3 | 100120010221112021120010 |
4 | 1131021020010131031 |
5 | 3114310320144411 |
6 | 113540000543433 |
7 | 10140240215652 |
oct | 1351110043515 |
9 | 316127467503 |
10 | 100011099981 |
11 | 39461727741 |
12 | 17471621b79 |
13 | 957abc7b90 |
14 | 4baa70dc29 |
15 | 29051cd7a6 |
hex | 174920474d |
100011099981 has 8 divisors (see below), whose sum is σ = 143605682080. Its totient is φ = 61545292272.
The previous prime is 100011099971. The next prime is 100011100051. The reversal of 100011099981 is 189990110001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100011099981 - 26 = 100011099917 is a prime.
It is a super-2 number, since 2×1000110999812 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39), and also a Moran number because the ratio is a prime number: 2564387179 = 100011099981 / (1 + 0 + 0 + 0 + 1 + 1 + 0 + 9 + 9 + 9 + 8 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100011099901) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1282193551 + ... + 1282193628.
It is an arithmetic number, because the mean of its divisors is an integer number (17950710260).
Almost surely, 2100011099981 is an apocalyptic number.
It is an amenable number.
100011099981 is a deficient number, since it is larger than the sum of its proper divisors (43594582099).
100011099981 is a wasteful number, since it uses less digits than its factorization.
100011099981 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2564387195.
The product of its (nonzero) digits is 5832, while the sum is 39.
The spelling of 100011099981 in words is "one hundred billion, eleven million, ninety-nine thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •