Base | Representation |
---|---|
bin | 1001001001010010011011… |
… | …0111010011100011111011 |
3 | 1022121021011010012121220010 |
4 | 2102110212313103203323 |
5 | 2304220442120102222 |
6 | 33215140451433003 |
7 | 2055314332541061 |
oct | 222244667234373 |
9 | 38537133177803 |
10 | 10055170472187 |
11 | 3227412659385 |
12 | 11649142b5763 |
13 | 57c277173039 |
14 | 26a95c418031 |
15 | 1268586b480c |
hex | 92526dd38fb |
10055170472187 has 8 divisors (see below), whose sum is σ = 14195534784336. Its totient is φ = 6309126570752.
The previous prime is 10055170472167. The next prime is 10055170472201. The reversal of 10055170472187 is 78127407155001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10055170472187 is a prime.
It is a super-2 number, since 2×100551704721872 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10055170472117) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 98580102618 + ... + 98580102719.
It is an arithmetic number, because the mean of its divisors is an integer number (1774441848042).
Almost surely, 210055170472187 is an apocalyptic number.
10055170472187 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
10055170472187 is a deficient number, since it is larger than the sum of its proper divisors (4140364312149).
10055170472187 is a wasteful number, since it uses less digits than its factorization.
10055170472187 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 197160205357.
The product of its (nonzero) digits is 548800, while the sum is 48.
The spelling of 10055170472187 in words is "ten trillion, fifty-five billion, one hundred seventy million, four hundred seventy-two thousand, one hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •