Base | Representation |
---|---|
bin | 1101100111011… |
… | …10101110110111 |
3 | 21221221011221120 |
4 | 12303232232313 |
5 | 213220132210 |
6 | 15200115023 |
7 | 2554613511 |
oct | 663565667 |
9 | 257834846 |
10 | 114224055 |
11 | 59527250 |
12 | 32305a73 |
13 | 1a883bca |
14 | 11254bb1 |
15 | a064270 |
hex | 6ceebb7 |
114224055 has 32 divisors (see below), whose sum is σ = 200309760. Its totient is φ = 55121280.
The previous prime is 114224023. The next prime is 114224087. The reversal of 114224055 is 550422411.
114224055 is a nontrivial binomial coefficient, being equal to C(15115, 2).
It is an interprime number because it is at equal distance from previous prime (114224023) and next prime (114224087).
It is not a de Polignac number, because 114224055 - 25 = 114224023 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 36274 + ... + 39296.
It is an arithmetic number, because the mean of its divisors is an integer number (6259680).
Almost surely, 2114224055 is an apocalyptic number.
114224055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
114224055 is the 15114-th triangular number.
114224055 is a deficient number, since it is larger than the sum of its proper divisors (86085705).
114224055 is a wasteful number, since it uses less digits than its factorization.
114224055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3271.
The product of its (nonzero) digits is 1600, while the sum is 24.
The square root of 114224055 is about 10687.5654383962. The cubic root of 114224055 is about 485.1982113983.
Adding to 114224055 its reverse (550422411), we get a palindrome (664646466).
The spelling of 114224055 in words is "one hundred fourteen million, two hundred twenty-four thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •