Base | Representation |
---|---|
bin | 11001111111011101100010… |
… | …101100001100001000101101 |
3 | 112222202010210111001202111022 |
4 | 121333131202230030020231 |
5 | 104440342401321144003 |
6 | 1043042145432503525 |
7 | 33035533064550431 |
oct | 3177354254141055 |
9 | 488663714052438 |
10 | 114312210334253 |
11 | 33472599690998 |
12 | 109a257bb4aba5 |
13 | 4ba27977c5339 |
14 | 2032a51d129c1 |
15 | d337c9ce8738 |
hex | 67f762b0c22d |
114312210334253 has 2 divisors, whose sum is σ = 114312210334254. Its totient is φ = 114312210334252.
The previous prime is 114312210334243. The next prime is 114312210334319. The reversal of 114312210334253 is 352433012213411.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 114271032996169 + 41177338084 = 10689763^2 + 202922^2 .
It is a cyclic number.
It is not a de Polignac number, because 114312210334253 - 228 = 114311941898797 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114312210334213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57156105167126 + 57156105167127.
It is an arithmetic number, because the mean of its divisors is an integer number (57156105167127).
Almost surely, 2114312210334253 is an apocalyptic number.
It is an amenable number.
114312210334253 is a deficient number, since it is larger than the sum of its proper divisors (1).
114312210334253 is an equidigital number, since it uses as much as digits as its factorization.
114312210334253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 35.
Adding to 114312210334253 its reverse (352433012213411), we get a palindrome (466745222547664).
The spelling of 114312210334253 in words is "one hundred fourteen trillion, three hundred twelve billion, two hundred ten million, three hundred thirty-four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •