Base | Representation |
---|---|
bin | 100110100101… |
… | …110111111001 |
3 | 201000222100221 |
4 | 212211313321 |
5 | 10042212401 |
6 | 1000500041 |
7 | 151663315 |
oct | 46456771 |
9 | 21028327 |
10 | 10116601 |
11 | 578a830 |
12 | 347a621 |
13 | 2132971 |
14 | 14b4b45 |
15 | d4c7a1 |
hex | 9a5df9 |
10116601 has 4 divisors (see below), whose sum is σ = 11036304. Its totient is φ = 9196900.
The previous prime is 10116599. The next prime is 10116629. The reversal of 10116601 is 10661101.
10116601 = 9542 + 9552 + ... + 9642.
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 10116601 - 21 = 10116599 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10116641) 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, 459835 + ... + 459856.
It is an arithmetic number, because the mean of its divisors is an integer number (2759076).
Almost surely, 210116601 is an apocalyptic number.
10116601 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10116601 is a deficient number, since it is larger than the sum of its proper divisors (919703).
10116601 is an equidigital number, since it uses as much as digits as its factorization.
10116601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 919702.
The product of its (nonzero) digits is 36, while the sum is 16.
The square root of 10116601 is about 3180.6604660039. The cubic root of 10116601 is about 216.2775994711.
Adding to 10116601 its reverse (10661101), we get a palindrome (20777702).
It can be divided in two parts, 10 and 116601, that added together give a palindrome (116611).
The spelling of 10116601 in words is "ten million, one hundred sixteen thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •