Base | Representation |
---|---|
bin | 11010000010111111101010… |
… | …101100101011010101101011 |
3 | 120000121100111122002121022212 |
4 | 122002333222230223111223 |
5 | 110003332130121111021 |
6 | 1043345502323235335 |
7 | 33062216642514134 |
oct | 3202775254532553 |
9 | 500540448077285 |
10 | 114555010332011 |
11 | 33556563986967 |
12 | 10a21641218b4b |
13 | 4bbc64ccc2c72 |
14 | 20406c63c4c8b |
15 | d39c8a98d85b |
hex | 682feab2b56b |
114555010332011 has 2 divisors, whose sum is σ = 114555010332012. Its totient is φ = 114555010332010.
The previous prime is 114555010331987. The next prime is 114555010332043. The reversal of 114555010332011 is 110233010555411.
It is an a-pointer prime, because the next prime (114555010332043) can be obtained adding 114555010332011 to its sum of digits (32).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 114555010332011 - 26 = 114555010331947 is a prime.
It is not a weakly prime, because it can be changed into another prime (114555010331011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57277505166005 + 57277505166006.
It is an arithmetic number, because the mean of its divisors is an integer number (57277505166006).
Almost surely, 2114555010332011 is an apocalyptic number.
114555010332011 is a deficient number, since it is larger than the sum of its proper divisors (1).
114555010332011 is an equidigital number, since it uses as much as digits as its factorization.
114555010332011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9000, while the sum is 32.
Adding to 114555010332011 its reverse (110233010555411), we get a palindrome (224788020887422).
The spelling of 114555010332011 in words is "one hundred fourteen trillion, five hundred fifty-five billion, ten million, three hundred thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •