Base | Representation |
---|---|
bin | 1011000001110011… |
… | …01101110110000101 |
3 | 120021121212020021100 |
4 | 11200321231312011 |
5 | 44111200210041 |
6 | 2415301210313 |
7 | 266502130152 |
oct | 54071556605 |
9 | 16247766240 |
10 | 5920710021 |
11 | 25690a5086 |
12 | 1192a00999 |
13 | 734826915 |
14 | 40248d229 |
15 | 249bc46b6 |
hex | 160e6dd85 |
5920710021 has 12 divisors (see below), whose sum is σ = 8589814272. Its totient is φ = 3929750376.
The previous prime is 5920710017. The next prime is 5920710043. The reversal of 5920710021 is 1200170295.
5920710021 is a `hidden beast` number, since 592 + 0 + 71 + 0 + 0 + 2 + 1 = 666.
5920710021 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5920710021 - 22 = 5920710017 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5920714021) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 1446981 + ... + 1451066.
It is an arithmetic number, because the mean of its divisors is an integer number (715817856).
Almost surely, 25920710021 is an apocalyptic number.
It is an amenable number.
5920710021 is a deficient number, since it is larger than the sum of its proper divisors (2669104251).
5920710021 is a wasteful number, since it uses less digits than its factorization.
5920710021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2898280 (or 2898277 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 27.
The square root of 5920710021 is about 76946.1501376125. The cubic root of 5920710021 is about 1809.0806581401.
The spelling of 5920710021 in words is "five billion, nine hundred twenty million, seven hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •