Base | Representation |
---|---|
bin | 101011101000100111110… |
… | …0100010110101101110111 |
3 | 210020022120212010112101021 |
4 | 1113101033210112231313 |
5 | 1241224034433304021 |
6 | 20431011200442011 |
7 | 1156163646522034 |
oct | 127211744265567 |
9 | 23208525115337 |
10 | 5997109275511 |
11 | 1a023a5929352 |
12 | 80a343919307 |
13 | 3466a94b8c33 |
14 | 16a393d1038b |
15 | a5eea2cbc41 |
hex | 5744f916b77 |
5997109275511 has 2 divisors, whose sum is σ = 5997109275512. Its totient is φ = 5997109275510.
The previous prime is 5997109275401. The next prime is 5997109275523. The reversal of 5997109275511 is 1155729017995.
5997109275511 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 is a cyclic number.
It is not a de Polignac number, because 5997109275511 - 215 = 5997109242743 is a prime.
It is a super-2 number, since 2×59971092755112 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5997109275511.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5997109275011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2998554637755 + 2998554637756.
It is an arithmetic number, because the mean of its divisors is an integer number (2998554637756).
Almost surely, 25997109275511 is an apocalyptic number.
5997109275511 is a deficient number, since it is larger than the sum of its proper divisors (1).
5997109275511 is an equidigital number, since it uses as much as digits as its factorization.
5997109275511 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8930250, while the sum is 61.
The spelling of 5997109275511 in words is "five trillion, nine hundred ninety-seven billion, one hundred nine million, two hundred seventy-five thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •