Base | Representation |
---|---|
bin | 100111101010000001100… |
… | …1111110010111010101111 |
3 | 201022001100111220112100002 |
4 | 1033110003033302322233 |
5 | 1203244323200032431 |
6 | 15331510421054515 |
7 | 1101530125231466 |
oct | 117240317627257 |
9 | 21261314815302 |
10 | 5450367970991 |
11 | 18115406a0a69 |
12 | 74039925743b |
13 | 306c7677b228 |
14 | 14bb290a39dd |
15 | 96b9ae483cb |
hex | 4f5033f2eaf |
5450367970991 has 2 divisors, whose sum is σ = 5450367970992. Its totient is φ = 5450367970990.
The previous prime is 5450367970937. The next prime is 5450367971003. The reversal of 5450367970991 is 1990797630545.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5450367970991 - 242 = 1052321459887 is a prime.
It is a super-2 number, since 2×54503679709912 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5450367970291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2725183985495 + 2725183985496.
It is an arithmetic number, because the mean of its divisors is an integer number (2725183985496).
Almost surely, 25450367970991 is an apocalyptic number.
5450367970991 is a deficient number, since it is larger than the sum of its proper divisors (1).
5450367970991 is an equidigital number, since it uses as much as digits as its factorization.
5450367970991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64297800, while the sum is 65.
The spelling of 5450367970991 in words is "five trillion, four hundred fifty billion, three hundred sixty-seven million, nine hundred seventy thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •