Base | Representation |
---|---|
bin | 101111010110111101… |
… | …0010110000001000101 |
3 | 100201111210020221022000 |
4 | 1132231322112001011 |
5 | 3131241203010314 |
6 | 114415442455513 |
7 | 10230161512461 |
oct | 1365572260105 |
9 | 321453227260 |
10 | 101702000709 |
11 | 3a14a145461 |
12 | 17863964599 |
13 | 978a30985a |
14 | 4ccb1074a1 |
15 | 29a3886209 |
hex | 17ade96045 |
101702000709 has 8 divisors (see below), whose sum is σ = 150669630720. Its totient is φ = 67801333788.
The previous prime is 101702000683. The next prime is 101702000711. The reversal of 101702000709 is 907000207101.
It is a de Polignac number, because none of the positive numbers 2k-101702000709 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 3766740767 = 101702000709 / (1 + 0 + 1 + 7 + 0 + 2 + 0 + 0 + 0 + 7 + 0 + 9).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101702000009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1883370357 + ... + 1883370410.
It is an arithmetic number, because the mean of its divisors is an integer number (18833703840).
Almost surely, 2101702000709 is an apocalyptic number.
It is an amenable number.
101702000709 is a deficient number, since it is larger than the sum of its proper divisors (48967630011).
101702000709 is an equidigital number, since it uses as much as digits as its factorization.
101702000709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3766740776 (or 3766740770 counting only the distinct ones).
The product of its (nonzero) digits is 882, while the sum is 27.
The spelling of 101702000709 in words is "one hundred one billion, seven hundred two million, seven hundred nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.226 sec. • engine limits •