Base | Representation |
---|---|
bin | 100110011111… |
… | …010010000001 |
3 | 200222121022221 |
4 | 212133102001 |
5 | 10040331401 |
6 | 1000131041 |
7 | 151521514 |
oct | 46372201 |
9 | 20877287 |
10 | 10089601 |
11 | 5771515 |
12 | 3466a81 |
13 | 21235a2 |
14 | 14a8d7b |
15 | d447a1 |
hex | 99f481 |
10089601 has 8 divisors (see below), whose sum is σ = 10462208. Its totient is φ = 9720000.
The previous prime is 10089581. The next prime is 10089623. The reversal of 10089601 is 10698001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a 5-Lehmer number, since φ(10089601) divides (10089601-1)5.
It is a cyclic number.
It is not a de Polignac number, because 10089601 - 29 = 10089089 is a prime.
It is a deceptive number, since it divides R10089600.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10089671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7801 + ... + 9001.
It is an arithmetic number, because the mean of its divisors is an integer number (1307776).
Almost surely, 210089601 is an apocalyptic number.
It is an amenable number.
10089601 is a deficient number, since it is larger than the sum of its proper divisors (372607).
10089601 is a wasteful number, since it uses less digits than its factorization.
10089601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1503.
The product of its (nonzero) digits is 432, while the sum is 25.
The square root of 10089601 is about 3176.4132287849. The cubic root of 10089601 is about 216.0850216849.
Subtracting 10089601 from its reverse (10698001), we obtain a square (608400 = 7802).
It can be divided in two parts, 1008 and 9601, that added together give a square (10609 = 1032).
The spelling of 10089601 in words is "ten million, eighty-nine thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •