Base | Representation |
---|---|
bin | 1001001010010000000010… |
… | …1111010101010010000101 |
3 | 1022122211211211121010100010 |
4 | 2102210000233111102011 |
5 | 2310003330420421221 |
6 | 33230514030340433 |
7 | 2056441244363250 |
oct | 222440057252205 |
9 | 38584754533303 |
10 | 10071710717061 |
11 | 3233430149144 |
12 | 1167b6b65a719 |
13 | 5809b1b32496 |
14 | 26b68b01a097 |
15 | 126ec5822c76 |
hex | 92900bd5485 |
10071710717061 has 8 divisors (see below), whose sum is σ = 15347368711744. Its totient is φ = 5755263266880.
The previous prime is 10071710716981. The next prime is 10071710717099. The reversal of 10071710717061 is 16071701717001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10071710717061 - 29 = 10071710716549 is a prime.
It is a super-2 number, since 2×100717107170612 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10071710713061) 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 7 ways as a sum of consecutive naturals, for example, 239802636100 + ... + 239802636141.
It is an arithmetic number, because the mean of its divisors is an integer number (1918421088968).
Almost surely, 210071710717061 is an apocalyptic number.
It is an amenable number.
10071710717061 is a deficient number, since it is larger than the sum of its proper divisors (5275657994683).
10071710717061 is an equidigital number, since it uses as much as digits as its factorization.
10071710717061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 479605272251.
The product of its (nonzero) digits is 14406, while the sum is 39.
The spelling of 10071710717061 in words is "ten trillion, seventy-one billion, seven hundred ten million, seven hundred seventeen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •