Base | Representation |
---|---|
bin | 1011111010111… |
… | …11001000101101 |
3 | 20222011202020120 |
4 | 11331133020231 |
5 | 201100120042 |
6 | 13531235153 |
7 | 2323011003 |
oct | 575371055 |
9 | 228152216 |
10 | 100004397 |
11 | 514a4869 |
12 | 295a8ab9 |
13 | 179457cc |
14 | d3d2a73 |
15 | 8ba5dec |
hex | 5f5f22d |
100004397 has 4 divisors (see below), whose sum is σ = 133339200. Its totient is φ = 66669596.
The previous prime is 100004393. The next prime is 100004407. The reversal of 100004397 is 793400001.
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 100004397 - 22 = 100004393 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100004393) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16667397 + ... + 16667402.
It is an arithmetic number, because the mean of its divisors is an integer number (33334800).
Almost surely, 2100004397 is an apocalyptic number.
It is an amenable number.
100004397 is a deficient number, since it is larger than the sum of its proper divisors (33334803).
100004397 is an equidigital number, since it uses as much as digits as its factorization.
100004397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33334802.
The product of its (nonzero) digits is 756, while the sum is 24.
The square root of 100004397 is about 10000.2198475834. The cubic root of 100004397 is about 464.1656862836.
Adding to 100004397 its product of nonzero digits (756), we get a triangular number (100005153 = T14142).
Adding to 100004397 its reverse (793400001), we get a palindrome (893404398).
The spelling of 100004397 in words is "one hundred million, four thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •