Base | Representation |
---|---|
bin | 1101101010000… |
… | …01000101001001 |
3 | 21222120022122002 |
4 | 12311001011021 |
5 | 213311430403 |
6 | 15211240345 |
7 | 2560520054 |
oct | 665010511 |
9 | 258508562 |
10 | 114561353 |
11 | 59737705 |
12 | 324490b5 |
13 | 1a9715aa |
14 | 11301a9b |
15 | a0ce188 |
hex | 6d41149 |
114561353 has 2 divisors, whose sum is σ = 114561354. Its totient is φ = 114561352.
The previous prime is 114561347. The next prime is 114561379. The reversal of 114561353 is 353165411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 87853129 + 26708224 = 9373^2 + 5168^2 .
It is an emirp because it is prime and its reverse (353165411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 114561353 - 218 = 114299209 is a prime.
It is equal to p6549023 and since 114561353 and 6549023 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (114561313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57280676 + 57280677.
It is an arithmetic number, because the mean of its divisors is an integer number (57280677).
Almost surely, 2114561353 is an apocalyptic number.
It is an amenable number.
114561353 is a deficient number, since it is larger than the sum of its proper divisors (1).
114561353 is an equidigital number, since it uses as much as digits as its factorization.
114561353 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5400, while the sum is 29.
The square root of 114561353 is about 10703.3337330011. Note that the first 3 decimals coincide. The cubic root of 114561353 is about 485.6753308642.
The spelling of 114561353 in words is "one hundred fourteen million, five hundred sixty-one thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •