Base | Representation |
---|---|
bin | 1101100110000… |
… | …11101010001100 |
3 | 21221121012221020 |
4 | 12303003222030 |
5 | 213144011003 |
6 | 15152234140 |
7 | 2553250242 |
oct | 663035214 |
9 | 257535836 |
10 | 114047628 |
11 | 59416742 |
12 | 3223b950 |
13 | 1a821806 |
14 | 1120a792 |
15 | a02bd53 |
hex | 6cc3a8c |
114047628 has 48 divisors (see below), whose sum is σ = 283336704. Its totient is φ = 35580160.
The previous prime is 114047621. The next prime is 114047629. The reversal of 114047628 is 826740411.
It is a super-2 number, since 2×1140476282 = 26013722904852768, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (114047621) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 37501 + ... + 40427.
It is an arithmetic number, because the mean of its divisors is an integer number (5902848).
Almost surely, 2114047628 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 114047628, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (141668352).
114047628 is an abundant number, since it is smaller than the sum of its proper divisors (169289076).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114047628 is a wasteful number, since it uses less digits than its factorization.
114047628 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3142 (or 3140 counting only the distinct ones).
The product of its (nonzero) digits is 10752, while the sum is 33.
The square root of 114047628 is about 10679.3084045738. The cubic root of 114047628 is about 484.9482752079.
The spelling of 114047628 in words is "one hundred fourteen million, forty-seven thousand, six hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •