Base | Representation |
---|---|
bin | 1101101001100… |
… | …11011110010100 |
3 | 21222110111011220 |
4 | 12310303132110 |
5 | 213303134440 |
6 | 15210130340 |
7 | 2560165425 |
oct | 664633624 |
9 | 258414156 |
10 | 114505620 |
11 | 596a9849 |
12 | 324209b0 |
13 | 1a952108 |
14 | 112c964c |
15 | a0bc8d0 |
hex | 6d33794 |
114505620 has 96 divisors (see below), whose sum is σ = 332760960. Its totient is φ = 29399040.
The previous prime is 114505597. The next prime is 114505631. The reversal of 114505620 is 26505411.
It is a super-2 number, since 2×1145056202 = 26223074023168800, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 218679 + ... + 219201.
It is an arithmetic number, because the mean of its divisors is an integer number (3466260).
Almost surely, 2114505620 is an apocalyptic number.
114505620 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 114505620, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166380480).
114505620 is an abundant number, since it is smaller than the sum of its proper divisors (218255340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114505620 is a wasteful number, since it uses less digits than its factorization.
114505620 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 665 (or 663 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 24.
The square root of 114505620 is about 10700.7298816483. The cubic root of 114505620 is about 485.5965592914.
The spelling of 114505620 in words is "one hundred fourteen million, five hundred five thousand, six hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •