Base | Representation |
---|---|
bin | 1101101011000… |
… | …10000011011101 |
3 | 21222211011220022 |
4 | 12311202003131 |
5 | 213330241123 |
6 | 15214201525 |
7 | 2561621606 |
oct | 665420335 |
9 | 258734808 |
10 | 114696413 |
11 | 5981a127 |
12 | 324b32a5 |
13 | 1a9bac00 |
14 | 11338dad |
15 | a1091c8 |
hex | 6d620dd |
114696413 has 12 divisors (see below), whose sum is σ = 126313920. Its totient is φ = 104070096.
The previous prime is 114696401. The next prime is 114696419. The reversal of 114696413 is 314696411.
It is not a de Polignac number, because 114696413 - 26 = 114696349 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 (114696419) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4220 + ... + 15722.
It is an arithmetic number, because the mean of its divisors is an integer number (10526160).
Almost surely, 2114696413 is an apocalyptic number.
114696413 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
114696413 is a deficient number, since it is larger than the sum of its proper divisors (11617507).
114696413 is a wasteful number, since it uses less digits than its factorization.
114696413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11588 (or 11575 counting only the distinct ones).
The product of its digits is 15552, while the sum is 35.
The square root of 114696413 is about 10709.6411237725. The cubic root of 114696413 is about 485.8661152427.
The spelling of 114696413 in words is "one hundred fourteen million, six hundred ninety-six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •