Base | Representation |
---|---|
bin | 110101010100011110… |
… | …0010001000100011101 |
3 | 101221112221120112011011 |
4 | 1222220330101010131 |
5 | 3334000400124131 |
6 | 124334023455221 |
7 | 11162334602644 |
oct | 1525074210435 |
9 | 357487515134 |
10 | 114503520541 |
11 | 44619285813 |
12 | 1a236bb7511 |
13 | aa4a536c67 |
14 | 578336835b |
15 | 2ea267e0b1 |
hex | 1aa8f1111d |
114503520541 has 2 divisors, whose sum is σ = 114503520542. Its totient is φ = 114503520540.
The previous prime is 114503520497. The next prime is 114503520557. The reversal of 114503520541 is 145025305411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 89024656900 + 25478863641 = 298370^2 + 159621^2 .
It is a cyclic number.
It is not a de Polignac number, because 114503520541 - 215 = 114503487773 is a prime.
It is a super-2 number, since 2×1145035205412 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114503520581) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57251760270 + 57251760271.
It is an arithmetic number, because the mean of its divisors is an integer number (57251760271).
Almost surely, 2114503520541 is an apocalyptic number.
It is an amenable number.
114503520541 is a deficient number, since it is larger than the sum of its proper divisors (1).
114503520541 is an equidigital number, since it uses as much as digits as its factorization.
114503520541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12000, while the sum is 31.
Adding to 114503520541 its reverse (145025305411), we get a palindrome (259528825952).
The spelling of 114503520541 in words is "one hundred fourteen billion, five hundred three million, five hundred twenty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •