Base | Representation |
---|---|
bin | 101010111110100100011… |
… | …0101100010101000001011 |
3 | 202220200111012002222120011 |
4 | 1111331020311202220023 |
5 | 1233234112304331034 |
6 | 20321314123012351 |
7 | 1146516026546215 |
oct | 125751065425013 |
9 | 22820435088504 |
10 | 5906802027019 |
11 | 1978073832993 |
12 | 7b494006a0b7 |
13 | 33b016b2b81a |
14 | 165c682b35b5 |
15 | a39b1ead864 |
hex | 55f48d62a0b |
5906802027019 has 2 divisors, whose sum is σ = 5906802027020. Its totient is φ = 5906802027018.
The previous prime is 5906802026977. The next prime is 5906802027041. The reversal of 5906802027019 is 9107202086095.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5906802027019 - 213 = 5906802018827 is a prime.
It is a super-2 number, since 2×59068020270192 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5906802027079) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2953401013509 + 2953401013510.
It is an arithmetic number, because the mean of its divisors is an integer number (2953401013510).
Almost surely, 25906802027019 is an apocalyptic number.
5906802027019 is a deficient number, since it is larger than the sum of its proper divisors (1).
5906802027019 is an equidigital number, since it uses as much as digits as its factorization.
5906802027019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 544320, while the sum is 49.
The spelling of 5906802027019 in words is "five trillion, nine hundred six billion, eight hundred two million, twenty-seven thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •