Base | Representation |
---|---|
bin | 1101101100010… |
… | …01000010110011 |
3 | 22000010021222012 |
4 | 12312021002303 |
5 | 213400343430 |
6 | 15221433135 |
7 | 2563155323 |
oct | 666110263 |
9 | 260107865 |
10 | 114856115 |
11 | 59919110 |
12 | 3256b7ab |
13 | 1aa457ca |
14 | 1137b283 |
15 | a13b695 |
hex | 6d890b3 |
114856115 has 8 divisors (see below), whose sum is σ = 150357168. Its totient is φ = 83531680.
The previous prime is 114856099. The next prime is 114856169. The reversal of 114856115 is 511658411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114856115 - 24 = 114856099 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1044092 + ... + 1044201.
It is an arithmetic number, because the mean of its divisors is an integer number (18794646).
Almost surely, 2114856115 is an apocalyptic number.
114856115 is a deficient number, since it is larger than the sum of its proper divisors (35501053).
114856115 is a wasteful number, since it uses less digits than its factorization.
114856115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2088309.
The product of its digits is 4800, while the sum is 32.
The square root of 114856115 is about 10717.0945223041. The cubic root of 114856115 is about 486.0915155046.
The spelling of 114856115 in words is "one hundred fourteen million, eight hundred fifty-six thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •