Base | Representation |
---|---|
bin | 11001111011000101011111… |
… | …000010010001001010110101 |
3 | 112221200101121112222011222011 |
4 | 121323011133002101022311 |
5 | 104420431023313134303 |
6 | 1042252054410404221 |
7 | 33005026200136006 |
oct | 3173053702211265 |
9 | 487611545864864 |
10 | 114011501302453 |
11 | 333670082365a7 |
12 | 10954239130671 |
13 | 4b80313b143b1 |
14 | 20222869651ad |
15 | d2aa7a28116d |
hex | 67b15f0912b5 |
114011501302453 has 2 divisors, whose sum is σ = 114011501302454. Its totient is φ = 114011501302452.
The previous prime is 114011501302429. The next prime is 114011501302459. The reversal of 114011501302453 is 354203105110411.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 94775540384529 + 19235960917924 = 9735273^2 + 4385882^2 .
It is a cyclic number.
It is not a de Polignac number, because 114011501302453 - 225 = 114011467748021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114011501302459) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57005750651226 + 57005750651227.
It is an arithmetic number, because the mean of its divisors is an integer number (57005750651227).
Almost surely, 2114011501302453 is an apocalyptic number.
It is an amenable number.
114011501302453 is a deficient number, since it is larger than the sum of its proper divisors (1).
114011501302453 is an equidigital number, since it uses as much as digits as its factorization.
114011501302453 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7200, while the sum is 31.
Adding to 114011501302453 its reverse (354203105110411), we get a palindrome (468214606412864).
The spelling of 114011501302453 in words is "one hundred fourteen trillion, eleven billion, five hundred one million, three hundred two thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •