Base | Representation |
---|---|
bin | 11001111110100110111010… |
… | …011101111101000100010101 |
3 | 112222112112101120210120120001 |
4 | 121332212322131331010111 |
5 | 104433412234141033011 |
6 | 1042555205144211301 |
7 | 33031355364400654 |
oct | 3176467235750425 |
9 | 488475346716501 |
10 | 114253553455381 |
11 | 3344a72938369a |
12 | 1099312ba69b31 |
13 | 4b9a0aa3c04a2 |
14 | 202dc899a719b |
15 | d31ee54527c1 |
hex | 67e9ba77d115 |
114253553455381 has 2 divisors, whose sum is σ = 114253553455382. Its totient is φ = 114253553455380.
The previous prime is 114253553455297. The next prime is 114253553455399. The reversal of 114253553455381 is 183554355352411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90661647332881 + 23591906122500 = 9521641^2 + 4857150^2 .
It is a cyclic number.
It is not a de Polignac number, because 114253553455381 - 29 = 114253553454869 is a prime.
It is a super-2 number, since 2×1142535534553812 (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 (114253553455781) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57126776727690 + 57126776727691.
It is an arithmetic number, because the mean of its divisors is an integer number (57126776727691).
Almost surely, 2114253553455381 is an apocalyptic number.
It is an amenable number.
114253553455381 is a deficient number, since it is larger than the sum of its proper divisors (1).
114253553455381 is an equidigital number, since it uses as much as digits as its factorization.
114253553455381 is an evil number, because the sum of its binary digits is even.
The product of its digits is 21600000, while the sum is 55.
The spelling of 114253553455381 in words is "one hundred fourteen trillion, two hundred fifty-three billion, five hundred fifty-three million, four hundred fifty-five thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •