Base | Representation |
---|---|
bin | 1010101001111110… |
… | …01000010100101110 |
3 | 112202200200212212000 |
4 | 11110333020110232 |
5 | 43204011140411 |
6 | 2343400353130 |
7 | 261524006541 |
oct | 52477102456 |
9 | 15680625760 |
10 | 5720802606 |
11 | 2476275742 |
12 | 1137a757a6 |
13 | 7022a27cc |
14 | 3c3ad2858 |
15 | 237387956 |
hex | 154fc852e |
5720802606 has 64 divisors (see below), whose sum is σ = 13419340800. Its totient is φ = 1801528128.
The previous prime is 5720802559. The next prime is 5720802613. The reversal of 5720802606 is 6062080275.
5720802606 is a `hidden beast` number, since 572 + 0 + 80 + 2 + 6 + 0 + 6 = 666.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 368946 + ... + 384138.
It is an arithmetic number, because the mean of its divisors is an integer number (209677200).
Almost surely, 25720802606 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5720802606, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6709670400).
5720802606 is an abundant number, since it is smaller than the sum of its proper divisors (7698538194).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5720802606 is a wasteful number, since it uses less digits than its factorization.
5720802606 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15590 (or 15584 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 36.
The square root of 5720802606 is about 75635.9875059485. The cubic root of 5720802606 is about 1788.4864504539.
The spelling of 5720802606 in words is "five billion, seven hundred twenty million, eight hundred two thousand, six hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •