Base | Representation |
---|---|
bin | 1010100101010111… |
… | …00101011110011101 |
3 | 112122222220211202000 |
4 | 11102223211132131 |
5 | 43114110442301 |
6 | 2335455352513 |
7 | 260544156141 |
oct | 52253453635 |
9 | 15588824660 |
10 | 5682124701 |
11 | 2456458430 |
12 | 1126b22739 |
13 | 6c727c986 |
14 | 3bc905221 |
15 | 233c97786 |
hex | 152ae579d |
5682124701 has 16 divisors (see below), whose sum is σ = 9183232320. Its totient is φ = 3443711760.
The previous prime is 5682124673. The next prime is 5682124717. The reversal of 5682124701 is 1074212865.
5682124701 is a `hidden beast` number, since 568 + 2 + 1 + 24 + 70 + 1 = 666.
It is not a de Polignac number, because 5682124701 - 27 = 5682124573 is a prime.
It is a super-2 number, since 2×56821247012 = 64573082235428678802, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5682124601) by changing a digit.
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, 9565570 + ... + 9566163.
It is an arithmetic number, because the mean of its divisors is an integer number (573952020).
Almost surely, 25682124701 is an apocalyptic number.
It is an amenable number.
5682124701 is a deficient number, since it is larger than the sum of its proper divisors (3501107619).
5682124701 is a wasteful number, since it uses less digits than its factorization.
5682124701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19131753 (or 19131747 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 36.
The square root of 5682124701 is about 75379.8693352542. The cubic root of 5682124701 is about 1784.4467263445.
The spelling of 5682124701 in words is "five billion, six hundred eighty-two million, one hundred twenty-four thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •