Base | Representation |
---|---|
bin | 10111001100010111000100… |
… | …001101011011000011001101 |
3 | 111101011112100220120022210201 |
4 | 113030113010031123003031 |
5 | 101332220123330300314 |
6 | 1000540112350533501 |
7 | 30325402601342356 |
oct | 2714270415330315 |
9 | 441145326508721 |
10 | 102004470165709 |
11 | 2a557942180691 |
12 | b535196807291 |
13 | 44bbc98839387 |
14 | 1b29085242d2d |
15 | bbd584e45b74 |
hex | 5cc5c435b0cd |
102004470165709 has 32 divisors (see below), whose sum is σ = 112958782709760. Its totient is φ = 91745057332800.
The previous prime is 102004470165683. The next prime is 102004470165743. The reversal of 102004470165709 is 907561074400201.
It is a cyclic number.
It is not a de Polignac number, because 102004470165709 - 27 = 102004470165581 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102004470165769) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1365562 + ... + 14348299.
It is an arithmetic number, because the mean of its divisors is an integer number (3529961959680).
Almost surely, 2102004470165709 is an apocalyptic number.
102004470165709 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
102004470165709 is a deficient number, since it is larger than the sum of its proper divisors (10954312544051).
102004470165709 is a wasteful number, since it uses less digits than its factorization.
102004470165709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15714121.
The product of its (nonzero) digits is 423360, while the sum is 46.
The spelling of 102004470165709 in words is "one hundred two trillion, four billion, four hundred seventy million, one hundred sixty-five thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •