Base | Representation |
---|---|
bin | 11001111011010001100110… |
… | …101011011111100000111001 |
3 | 112221201122012110111122112212 |
4 | 121323101212223133200321 |
5 | 104421134201144422023 |
6 | 1042302045551344505 |
7 | 33005666523110051 |
oct | 3173214653374071 |
9 | 487648173448485 |
10 | 114024514451513 |
11 | 33371585882046 |
12 | 1095686b222135 |
13 | 4b81608b3b0b3 |
14 | 2022b5cd54561 |
15 | d2b08c92de78 |
hex | 67b466adf839 |
114024514451513 has 2 divisors, whose sum is σ = 114024514451514. Its totient is φ = 114024514451512.
The previous prime is 114024514451473. The next prime is 114024514451557. The reversal of 114024514451513 is 315154415420411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109536590836729 + 4487923614784 = 10465973^2 + 2118472^2 .
It is a cyclic number.
It is not a de Polignac number, because 114024514451513 - 28 = 114024514451257 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (114024514451213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57012257225756 + 57012257225757.
It is an arithmetic number, because the mean of its divisors is an integer number (57012257225757).
Almost surely, 2114024514451513 is an apocalyptic number.
It is an amenable number.
114024514451513 is a deficient number, since it is larger than the sum of its proper divisors (1).
114024514451513 is an equidigital number, since it uses as much as digits as its factorization.
114024514451513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192000, while the sum is 41.
Adding to 114024514451513 its reverse (315154415420411), we get a palindrome (429178929871924).
The spelling of 114024514451513 in words is "one hundred fourteen trillion, twenty-four billion, five hundred fourteen million, four hundred fifty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •