Base | Representation |
---|---|
bin | 11010001100111000001111… |
… | …101010100001000010101111 |
3 | 120010000021200222210211122022 |
4 | 122030320033222201002233 |
5 | 110100444203222332221 |
6 | 1045025513224540355 |
7 | 33162253530120362 |
oct | 3214701752410257 |
9 | 503007628724568 |
10 | 115234235355311 |
11 | 33798623787026 |
12 | 10b112003216bb |
13 | 4c3b707354087 |
14 | 206551c5100d9 |
15 | d4c790c474ab |
hex | 68ce0faa10af |
115234235355311 has 2 divisors, whose sum is σ = 115234235355312. Its totient is φ = 115234235355310.
The previous prime is 115234235355299. The next prime is 115234235355353. The reversal of 115234235355311 is 113553532432511.
It is a weak prime.
It is an emirp because it is prime and its reverse (113553532432511) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 115234235355311 - 226 = 115234168246447 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115234235354311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57617117677655 + 57617117677656.
It is an arithmetic number, because the mean of its divisors is an integer number (57617117677656).
Almost surely, 2115234235355311 is an apocalyptic number.
115234235355311 is a deficient number, since it is larger than the sum of its proper divisors (1).
115234235355311 is an equidigital number, since it uses as much as digits as its factorization.
115234235355311 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 810000, while the sum is 44.
Adding to 115234235355311 its reverse (113553532432511), we get a palindrome (228787767787822).
The spelling of 115234235355311 in words is "one hundred fifteen trillion, two hundred thirty-four billion, two hundred thirty-five million, three hundred fifty-five thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •