Base | Representation |
---|---|
bin | 11010010001001110110011… |
… | …001010101111111000011011 |
3 | 120011001212201111110202120012 |
4 | 122101032303022233320123 |
5 | 110120344230243444311 |
6 | 1045415140223352135 |
7 | 33223002436131563 |
oct | 3221166312577033 |
9 | 504055644422505 |
10 | 115533331234331 |
11 | 338a34575968aa |
12 | 10b5b172a5264b |
13 | 4c60991a7564a |
14 | 2075bb3541da3 |
15 | d55448d6378b |
hex | 6913b32afe1b |
115533331234331 has 2 divisors, whose sum is σ = 115533331234332. Its totient is φ = 115533331234330.
The previous prime is 115533331234301. The next prime is 115533331234339. The reversal of 115533331234331 is 133432133335511.
It is a strong prime.
It is an emirp because it is prime and its reverse (133432133335511) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-115533331234331 is a prime.
It is a super-2 number, since 2×1155333312343312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (115533331234339) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57766665617165 + 57766665617166.
It is an arithmetic number, because the mean of its divisors is an integer number (57766665617166).
Almost surely, 2115533331234331 is an apocalyptic number.
115533331234331 is a deficient number, since it is larger than the sum of its proper divisors (1).
115533331234331 is an equidigital number, since it uses as much as digits as its factorization.
115533331234331 is an evil number, because the sum of its binary digits is even.
The product of its digits is 437400, while the sum is 41.
Adding to 115533331234331 its reverse (133432133335511), we get a palindrome (248965464569842).
The spelling of 115533331234331 in words is "one hundred fifteen trillion, five hundred thirty-three billion, three hundred thirty-one million, two hundred thirty-four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •