Base | Representation |
---|---|
bin | 100101100111111011010… |
… | …1111110111100110011000 |
3 | 200022100012212022110012202 |
4 | 1023033312233313212120 |
5 | 1134210134230310403 |
6 | 14555303511025332 |
7 | 1042406560454540 |
oct | 113176657674630 |
9 | 20270185273182 |
10 | 5170985400728 |
11 | 17140034a68a4 |
12 | 6b620866b248 |
13 | 2b68112163b4 |
14 | 13c3c424a320 |
15 | 8e798817688 |
hex | 4b3f6bf7998 |
5170985400728 has 16 divisors (see below), whose sum is σ = 11080683001680. Its totient is φ = 2216136600288.
The previous prime is 5170985400703. The next prime is 5170985400733. The reversal of 5170985400728 is 8270045890715.
It is a super-2 number, since 2×51709854007282 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (56), and also a Moran number because the ratio is a prime number: 92339025013 = 5170985400728 / (5 + 1 + 7 + 0 + 9 + 8 + 5 + 4 + 0 + 0 + 7 + 2 + 8).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 46169512451 + ... + 46169512562.
It is an arithmetic number, because the mean of its divisors is an integer number (692542687605).
Almost surely, 25170985400728 is an apocalyptic number.
It is an amenable number.
5170985400728 is an abundant number, since it is smaller than the sum of its proper divisors (5909697600952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5170985400728 is a wasteful number, since it uses less digits than its factorization.
5170985400728 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92339025026 (or 92339025022 counting only the distinct ones).
The product of its (nonzero) digits is 5644800, while the sum is 56.
The spelling of 5170985400728 in words is "five trillion, one hundred seventy billion, nine hundred eighty-five million, four hundred thousand, seven hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •