Base | Representation |
---|---|
bin | 101011000101000000011… |
… | …1011111010011111011001 |
3 | 202222000011202100110111122 |
4 | 1112022000323322133121 |
5 | 1234000421244423414 |
6 | 20331522104135025 |
7 | 1150515453460553 |
oct | 126120073723731 |
9 | 22860152313448 |
10 | 5920628123609 |
11 | 1982a192529a1 |
12 | 7b755a467475 |
13 | 33c40b3bc774 |
14 | 1667ba63c4d3 |
15 | a4020bdeb8e |
hex | 56280efa7d9 |
5920628123609 has 2 divisors, whose sum is σ = 5920628123610. Its totient is φ = 5920628123608.
The previous prime is 5920628123591. The next prime is 5920628123621. The reversal of 5920628123609 is 9063218260295.
5920628123609 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5916156259225 + 4471864384 = 2432315^2 + 66872^2 .
It is a cyclic number.
It is not a de Polignac number, because 5920628123609 - 28 = 5920628123353 is a prime.
It is not a weakly prime, because it can be changed into another prime (5920628123309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2960314061804 + 2960314061805.
It is an arithmetic number, because the mean of its divisors is an integer number (2960314061805).
Almost surely, 25920628123609 is an apocalyptic number.
It is an amenable number.
5920628123609 is a deficient number, since it is larger than the sum of its proper divisors (1).
5920628123609 is an equidigital number, since it uses as much as digits as its factorization.
5920628123609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2799360, while the sum is 53.
The spelling of 5920628123609 in words is "five trillion, nine hundred twenty billion, six hundred twenty-eight million, one hundred twenty-three thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •