Base | Representation |
---|---|
bin | 10000100101111011001… |
… | …00000000101101110001 |
3 | 2000111120100212102112101 |
4 | 20102331210000231301 |
5 | 33320044200021014 |
6 | 1113524020500401 |
7 | 56122002121120 |
oct | 10227544005561 |
9 | 2014510772471 |
10 | 570116017009 |
11 | 1aa86a6a08a0 |
12 | 925aa84a701 |
13 | 419b9626436 |
14 | 1d8453d9ab7 |
15 | ec6b50e474 |
hex | 84bd900b71 |
570116017009 has 8 divisors (see below), whose sum is σ = 710793995328. Its totient is φ = 444246246960.
The previous prime is 570116017007. The next prime is 570116017033. The reversal of 570116017009 is 900710611075.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 570116017009 - 21 = 570116017007 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (570116017007) 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, 3702051982 + ... + 3702052135.
It is an arithmetic number, because the mean of its divisors is an integer number (88849249416).
Almost surely, 2570116017009 is an apocalyptic number.
It is an amenable number.
570116017009 is a deficient number, since it is larger than the sum of its proper divisors (140677978319).
570116017009 is a wasteful number, since it uses less digits than its factorization.
570116017009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7404104135.
The product of its (nonzero) digits is 13230, while the sum is 37.
The spelling of 570116017009 in words is "five hundred seventy billion, one hundred sixteen million, seventeen thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •