Base | Representation |
---|---|
bin | 1101100111011… |
… | …10110101001101 |
3 | 21221221012111121 |
4 | 12303232311031 |
5 | 213220140321 |
6 | 15200120541 |
7 | 2554614631 |
oct | 663566515 |
9 | 257835447 |
10 | 114224461 |
11 | 5952758a |
12 | 32306151 |
13 | 1a884150 |
14 | 11254dc1 |
15 | a064441 |
hex | 6ceed4d |
114224461 has 8 divisors (see below), whose sum is σ = 123724440. Its totient is φ = 104826432.
The previous prime is 114224437. The next prime is 114224471. The reversal of 114224461 is 164422411.
It can be written as a sum of positive squares in 4 ways, for example, as 2499561 + 111724900 = 1581^2 + 10570^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 114224461 - 217 = 114093389 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114224471) 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 in 7 ways as a sum of consecutive naturals, for example, 23146 + ... + 27643.
It is an arithmetic number, because the mean of its divisors is an integer number (15465555).
Almost surely, 2114224461 is an apocalyptic number.
It is an amenable number.
114224461 is a deficient number, since it is larger than the sum of its proper divisors (9499979).
114224461 is a wasteful number, since it uses less digits than its factorization.
114224461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50975.
The product of its digits is 1536, while the sum is 25.
The square root of 114224461 is about 10687.5844324150. The cubic root of 114224461 is about 485.1987862634.
Adding to 114224461 its reverse (164422411), we get a palindrome (278646872).
The spelling of 114224461 in words is "one hundred fourteen million, two hundred twenty-four thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •