Base | Representation |
---|---|
bin | 1101100111100… |
… | …01110100111010 |
3 | 21221221211100000 |
4 | 12303301310322 |
5 | 213221033410 |
6 | 15200253430 |
7 | 2554665456 |
oct | 663616472 |
9 | 257854300 |
10 | 114236730 |
11 | 59535823 |
12 | 32311276 |
13 | 1a8898ca |
14 | 11259666 |
15 | a067dc0 |
hex | 6cf1d3a |
114236730 has 96 divisors (see below), whose sum is σ = 314181504. Its totient is φ = 29854656.
The previous prime is 114236729. The next prime is 114236741. The reversal of 114236730 is 37632411.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 114236694 and 114236703.
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, 128347 + ... + 129233.
It is an arithmetic number, because the mean of its divisors is an integer number (3272724).
Almost surely, 2114236730 is an apocalyptic number.
114236730 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 114236730, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157090752).
114236730 is an abundant number, since it is smaller than the sum of its proper divisors (199944774).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114236730 is an equidigital number, since it uses as much as digits as its factorization.
114236730 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 962 (or 950 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 27.
The square root of 114236730 is about 10688.1584007723. The cubic root of 114236730 is about 485.2161575886.
The spelling of 114236730 in words is "one hundred fourteen million, two hundred thirty-six thousand, seven hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •