Base | Representation |
---|---|
bin | 11010001011101100001011… |
… | …000011000011111011111111 |
3 | 120002201110212110000221011111 |
4 | 122023230023003003323333 |
5 | 110043124412200244431 |
6 | 1044524204111502451 |
7 | 33153332424040363 |
oct | 3213541303037377 |
9 | 502643773027144 |
10 | 115152553524991 |
11 | 33766a18497a34 |
12 | 10ab9405227a27 |
13 | 4c33aba964cb8 |
14 | 20615b025d2a3 |
15 | d4a5aecb37b1 |
hex | 68bb0b0c3eff |
115152553524991 has 2 divisors, whose sum is σ = 115152553524992. Its totient is φ = 115152553524990.
The previous prime is 115152553524889. The next prime is 115152553525117. The reversal of 115152553524991 is 199425355251511.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-115152553524991 is a prime.
It is a super-2 number, since 2×1151525535249912 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115152553554991) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57576276762495 + 57576276762496.
It is an arithmetic number, because the mean of its divisors is an integer number (57576276762496).
Almost surely, 2115152553524991 is an apocalyptic number.
115152553524991 is a deficient number, since it is larger than the sum of its proper divisors (1).
115152553524991 is an equidigital number, since it uses as much as digits as its factorization.
115152553524991 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 12150000, while the sum is 58.
The spelling of 115152553524991 in words is "one hundred fifteen trillion, one hundred fifty-two billion, five hundred fifty-three million, five hundred twenty-four thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •