Base | Representation |
---|---|
bin | 1101100110101… |
… | …11110100100100 |
3 | 21221202102012220 |
4 | 12303113310210 |
5 | 213204131322 |
6 | 15154112340 |
7 | 2554043100 |
oct | 663276444 |
9 | 257672186 |
10 | 114130212 |
11 | 59472799 |
12 | 3227b6b0 |
13 | 1a850291 |
14 | 1122c900 |
15 | a04655c |
hex | 6cd7d24 |
114130212 has 72 divisors (see below), whose sum is σ = 314514144. Its totient is φ = 32110848.
The previous prime is 114130199. The next prime is 114130271. The reversal of 114130212 is 212031411.
It is a junction number, because it is equal to n+sod(n) for n = 114130191 and 114130200.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 37948 + ... + 40844.
It is an arithmetic number, because the mean of its divisors is an integer number (4368252).
Almost surely, 2114130212 is an apocalyptic number.
114130212 is a gapful number since it is divisible by the number (12) 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 114130212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157257072).
114130212 is an abundant number, since it is smaller than the sum of its proper divisors (200383932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114130212 is a wasteful number, since it uses less digits than its factorization.
114130212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2985 (or 2976 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 114130212 is about 10683.1742473855. The cubic root of 114130212 is about 485.0653003088.
Adding to 114130212 its reverse (212031411), we get a palindrome (326161623).
The spelling of 114130212 in words is "one hundred fourteen million, one hundred thirty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •