Base | Representation |
---|---|
bin | 1010100101110110… |
… | …10110100110100010 |
3 | 112200021200211200012 |
4 | 11102323112212202 |
5 | 43121140224312 |
6 | 2340124124522 |
7 | 260624252621 |
oct | 52273264642 |
9 | 15607624605 |
10 | 5686258082 |
11 | 245882094a |
12 | 1128396742 |
13 | 6c809916b |
14 | 3bd29d6b8 |
15 | 234312322 |
hex | 152ed69a2 |
5686258082 has 18 divisors (see below), whose sum is σ = 8662746267. Its totient is φ = 2799352500.
The previous prime is 5686258051. The next prime is 5686258121. The reversal of 5686258082 is 2808526865.
It can be written as a sum of positive squares in only one way, i.e., 2843129041 + 2843129041 = 53321^2 + 53321^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=53321.
It is a super-2 number, since 2×56862580822 = 64667061950220637448, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5686258082.
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 8 ways as a sum of consecutive naturals, for example, 7571207 + ... + 7571957.
Almost surely, 25686258082 is an apocalyptic number.
5686258082 is a deficient number, since it is larger than the sum of its proper divisors (2976488185).
5686258082 is an frugal number, since it uses more digits than its factorization.
5686258082 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1646 (or 824 counting only the distinct ones).
The product of its (nonzero) digits is 1843200, while the sum is 50.
The square root of 5686258082 is about 75407.2813592958. The cubic root of 5686258082 is about 1784.8793116203.
Multiplying 5686258082 by its sum of digits (50), we get a square (284312904100 = 5332102).
The spelling of 5686258082 in words is "five billion, six hundred eighty-six million, two hundred fifty-eight thousand, eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •