Base | Representation |
---|---|
bin | 11001111011010111001011… |
… | …101101110011110110100101 |
3 | 112221202012122220212220220122 |
4 | 121323113023231303312211 |
5 | 104421233433124301341 |
6 | 1042304520211411325 |
7 | 33006301126643564 |
oct | 3173271355636645 |
9 | 487665586786818 |
10 | 114030504525221 |
11 | 3337407a043089 |
12 | 10957a612b3b45 |
13 | 4b82051b3c9cb |
14 | 202316a6dbbdb |
15 | d2b2dd75594b |
hex | 67b5cbb73da5 |
114030504525221 has 2 divisors, whose sum is σ = 114030504525222. Its totient is φ = 114030504525220.
The previous prime is 114030504525199. The next prime is 114030504525229. The reversal of 114030504525221 is 122525405030411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 95140711080100 + 18889793445121 = 9754010^2 + 4346239^2 .
It is a cyclic number.
It is not a de Polignac number, because 114030504525221 - 234 = 114013324656037 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114030504525229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57015252262610 + 57015252262611.
It is an arithmetic number, because the mean of its divisors is an integer number (57015252262611).
Almost surely, 2114030504525221 is an apocalyptic number.
It is an amenable number.
114030504525221 is a deficient number, since it is larger than the sum of its proper divisors (1).
114030504525221 is an equidigital number, since it uses as much as digits as its factorization.
114030504525221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48000, while the sum is 35.
Adding to 114030504525221 its reverse (122525405030411), we get a palindrome (236555909555632).
The spelling of 114030504525221 in words is "one hundred fourteen trillion, thirty billion, five hundred four million, five hundred twenty-five thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •