Base | Representation |
---|---|
bin | 1101100101110… |
… | …11010111010010 |
3 | 21221112111022210 |
4 | 12302323113102 |
5 | 213141414100 |
6 | 15151412550 |
7 | 2553046212 |
oct | 662732722 |
9 | 257474283 |
10 | 114013650 |
11 | 593a3163 |
12 | 32224156 |
13 | 1a80c1ca |
14 | 111dc242 |
15 | a021c50 |
hex | 6cbb5d2 |
114013650 has 48 divisors (see below), whose sum is σ = 290409984. Its totient is φ = 29580480.
The previous prime is 114013649. The next prime is 114013651. The reversal of 114013650 is 56310411.
It is an interprime number because it is at equal distance from previous prime (114013649) and next prime (114013651).
It is a super-2 number, since 2×1140136502 = 25998224772645000, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (114013651) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4722 + ... + 15821.
It is an arithmetic number, because the mean of its divisors is an integer number (6050208).
Almost surely, 2114013650 is an apocalyptic number.
114013650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
114013650 is an abundant number, since it is smaller than the sum of its proper divisors (176396334).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114013650 is a wasteful number, since it uses less digits than its factorization.
114013650 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20595 (or 20590 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 21.
The square root of 114013650 is about 10677.7174527143. The cubic root of 114013650 is about 484.9001105086.
It can be divided in two parts, 11401 and 3650, that added together give a palindrome (15051).
The spelling of 114013650 in words is "one hundred fourteen million, thirteen thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •