Base | Representation |
---|---|
bin | 10010101010000111… |
… | …10101000011101011 |
3 | 221212002202102002020 |
4 | 21111003311003223 |
5 | 131003323023312 |
6 | 4333551035523 |
7 | 503142052416 |
oct | 112503650353 |
9 | 27762672066 |
10 | 10017001707 |
11 | 4280377709 |
12 | 1b3680bba3 |
13 | c38390c5b |
14 | 6b050ab7d |
15 | 3d961a78c |
hex | 2550f50eb |
10017001707 has 4 divisors (see below), whose sum is σ = 13356002280. Its totient is φ = 6678001136.
The previous prime is 10017001703. The next prime is 10017001777. The reversal of 10017001707 is 70710071001.
10017001707 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 70710071001 = 3 ⋅23570023667.
It is a cyclic number.
It is not a de Polignac number, because 10017001707 - 22 = 10017001703 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10017001703) 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, 1669500282 + ... + 1669500287.
It is an arithmetic number, because the mean of its divisors is an integer number (3339000570).
Almost surely, 210017001707 is an apocalyptic number.
10017001707 is a deficient number, since it is larger than the sum of its proper divisors (3339000573).
10017001707 is an equidigital number, since it uses as much as digits as its factorization.
10017001707 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3339000572.
The product of its (nonzero) digits is 343, while the sum is 24.
Adding to 10017001707 its reverse (70710071001), we get a palindrome (80727072708).
The spelling of 10017001707 in words is "ten billion, seventeen million, one thousand, seven hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •