Base | Representation |
---|---|
bin | 1101100111110… |
… | …11010010101100 |
3 | 21222000210111221 |
4 | 12303323102230 |
5 | 213223304000 |
6 | 15201153124 |
7 | 2555216503 |
oct | 663732254 |
9 | 258023457 |
10 | 114275500 |
11 | 59561969 |
12 | 3232b7a4 |
13 | 1a8a1451 |
14 | 1126983a |
15 | a07461a |
hex | 6cfb4ac |
114275500 has 96 divisors (see below), whose sum is σ = 274659840. Its totient is φ = 41342400.
The previous prime is 114275461. The next prime is 114275501. The reversal of 114275500 is 5572411.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (114275501) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 218239 + ... + 218761.
It is an arithmetic number, because the mean of its divisors is an integer number (2861040).
Almost surely, 2114275500 is an apocalyptic number.
114275500 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 114275500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (137329920).
114275500 is an abundant number, since it is smaller than the sum of its proper divisors (160384340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114275500 is a wasteful number, since it uses less digits than its factorization.
114275500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 584 (or 572 counting only the distinct ones).
The product of its (nonzero) digits is 1400, while the sum is 25.
The square root of 114275500 is about 10689.9719363523. The cubic root of 114275500 is about 485.2710427459.
The spelling of 114275500 in words is "one hundred fourteen million, two hundred seventy-five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •