Base | Representation |
---|---|
bin | 1001010110100111… |
… | …11011001001101110 |
3 | 110221222001020202000 |
4 | 10223103323021232 |
5 | 40241013014411 |
6 | 2150142313130 |
7 | 235303662105 |
oct | 45323731156 |
9 | 13858036660 |
10 | 5021610606 |
11 | 2147628411 |
12 | b818887a6 |
13 | 62048712c |
14 | 358cc903c |
15 | 1e5cc4956 |
hex | 12b4fb26e |
5021610606 has 32 divisors (see below), whose sum is σ = 11418654720. Its totient is φ = 1634942232.
The previous prime is 5021610553. The next prime is 5021610647. The reversal of 5021610606 is 6060161205.
It is a happy number.
5021610606 is a `hidden beast` number, since 50 + 2 + 1 + 6 + 1 + 0 + 606 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 5021610606.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1078990 + ... + 1083633.
It is an arithmetic number, because the mean of its divisors is an integer number (356832960).
Almost surely, 25021610606 is an apocalyptic number.
5021610606 is an abundant number, since it is smaller than the sum of its proper divisors (6397044114).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5021610606 is a wasteful number, since it uses less digits than its factorization.
5021610606 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2162677 (or 2162671 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 5021610606 is about 70863.3234191002. The cubic root of 5021610606 is about 1712.4359803158.
The spelling of 5021610606 in words is "five billion, twenty-one million, six hundred ten thousand, six hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •