Base | Representation |
---|---|
bin | 1101101000001… |
… | …00101110010010 |
3 | 21222002202111200 |
4 | 12310010232102 |
5 | 213231023010 |
6 | 15202052030 |
7 | 2555440230 |
oct | 664045622 |
9 | 258082450 |
10 | 114314130 |
11 | 59588997 |
12 | 3234a016 |
13 | 1a8b5bc8 |
14 | 11279950 |
15 | a080cc0 |
hex | 6d04b92 |
114314130 has 96 divisors (see below), whose sum is σ = 341273088. Its totient is φ = 26006400.
The previous prime is 114314119. The next prime is 114314149. The reversal of 114314130 is 31413411.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 265015 + ... + 265445.
It is an arithmetic number, because the mean of its divisors is an integer number (3554928).
Almost surely, 2114314130 is an apocalyptic number.
114314130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 114314130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (170636544).
114314130 is an abundant number, since it is smaller than the sum of its proper divisors (226958958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114314130 is a wasteful number, since it uses less digits than its factorization.
114314130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 872 (or 869 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
The square root of 114314130 is about 10691.7786172367. The cubic root of 114314130 is about 485.3257173655.
Adding to 114314130 its reverse (31413411), we get a palindrome (145727541).
The spelling of 114314130 in words is "one hundred fourteen million, three hundred fourteen thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •