Base | Representation |
---|---|
bin | 1011111011000… |
… | …00100000001101 |
3 | 20222012000220222 |
4 | 11331200200031 |
5 | 201100304442 |
6 | 13531321125 |
7 | 2323033223 |
oct | 575404015 |
9 | 228160828 |
10 | 100009997 |
11 | 514a8a9a |
12 | 295b01a5 |
13 | 17948219 |
14 | d3d4b13 |
15 | 8ba78d2 |
hex | 5f6080d |
100009997 has 4 divisors (see below), whose sum is σ = 105892956. Its totient is φ = 94127040.
The previous prime is 100009979. The next prime is 100010017. The reversal of 100009997 is 799900001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 56265001 + 43744996 = 7501^2 + 6614^2 .
It is a cyclic number.
It is not a de Polignac number, because 100009997 - 26 = 100009933 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100009097) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2941454 + ... + 2941487.
It is an arithmetic number, because the mean of its divisors is an integer number (26473239).
Almost surely, 2100009997 is an apocalyptic number.
100009997 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
100009997 is a deficient number, since it is larger than the sum of its proper divisors (5882959).
100009997 is an equidigital number, since it uses as much as digits as its factorization.
100009997 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5882958.
The product of its (nonzero) digits is 5103, while the sum is 35.
The square root of 100009997 is about 10000.4998375081. The cubic root of 100009997 is about 464.1743501671.
Adding to 100009997 its reverse (799900001), we get a palindrome (899909998).
The spelling of 100009997 in words is "one hundred million, nine thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •