Base | Representation |
---|---|
bin | 100100110010000111101… |
… | …0000100101000000010111 |
3 | 122220021221210011110212002 |
4 | 1021210033100211000113 |
5 | 1130312011210332021 |
6 | 14430233355345515 |
7 | 1031146221222644 |
oct | 111441720450027 |
9 | 18807853143762 |
10 | 5055432511511 |
11 | 1679aa6948948 |
12 | 69793a15229b |
13 | 2a8957478335 |
14 | 1369817a2dcb |
15 | 8b783ea450b |
hex | 4990f425017 |
5055432511511 has 2 divisors, whose sum is σ = 5055432511512. Its totient is φ = 5055432511510.
The previous prime is 5055432511453. The next prime is 5055432511537. The reversal of 5055432511511 is 1151152345505.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5055432511511 - 230 = 5054358769687 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5055432511411) 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 as a sum of consecutive naturals, namely, 2527716255755 + 2527716255756.
It is an arithmetic number, because the mean of its divisors is an integer number (2527716255756).
Almost surely, 25055432511511 is an apocalyptic number.
5055432511511 is a deficient number, since it is larger than the sum of its proper divisors (1).
5055432511511 is an equidigital number, since it uses as much as digits as its factorization.
5055432511511 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 75000, while the sum is 38.
The spelling of 5055432511511 in words is "five trillion, fifty-five billion, four hundred thirty-two million, five hundred eleven thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •