Base | Representation |
---|---|
bin | 1001100001010101… |
… | …10010100000010110 |
3 | 111012020011121220000 |
4 | 10300222302200112 |
5 | 40432020144312 |
6 | 2203112552130 |
7 | 240444644622 |
oct | 46052624026 |
9 | 14166147800 |
10 | 5111490582 |
11 | 2193337590 |
12 | ba79b2646 |
13 | 635c96553 |
14 | 366c04182 |
15 | 1edb2aadc |
hex | 130ab2816 |
5111490582 has 160 divisors (see below), whose sum is σ = 13105217664. Its totient is φ = 1475107200.
The previous prime is 5111490577. The next prime is 5111490611. The reversal of 5111490582 is 2850941115.
5111490582 is a `hidden beast` number, since 5 + 111 + 490 + 58 + 2 = 666.
It is a super-2 number, since 2×51114905822 = 52254671939749397448, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 3140853 + ... + 3142479.
Almost surely, 25111490582 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5111490582, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6552608832).
5111490582 is an abundant number, since it is smaller than the sum of its proper divisors (7993727082).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5111490582 is a wasteful number, since it uses less digits than its factorization.
5111490582 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1736 (or 1727 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 36.
The square root of 5111490582 is about 71494.6891873795. The cubic root of 5111490582 is about 1722.5923795689.
The spelling of 5111490582 in words is "five billion, one hundred eleven million, four hundred ninety thousand, five hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •