Base | Representation |
---|---|
bin | 1101100101110… |
… | …11100010010000 |
3 | 21221112112021210 |
4 | 12302323202100 |
5 | 213141424402 |
6 | 15151420120 |
7 | 2553051234 |
oct | 662734220 |
9 | 257475253 |
10 | 114014352 |
11 | 593a3741 |
12 | 32224640 |
13 | 1a80c61a |
14 | 111dc5c4 |
15 | a02206c |
hex | 6cbb890 |
114014352 has 20 divisors (see below), whose sum is σ = 294537200. Its totient is φ = 38004768.
The previous prime is 114014321. The next prime is 114014357. The reversal of 114014352 is 253410411.
It is not an unprimeable number, because it can be changed into a prime (114014357) 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 3 ways as a sum of consecutive naturals, for example, 1187602 + ... + 1187697.
It is an arithmetic number, because the mean of its divisors is an integer number (14726860).
Almost surely, 2114014352 is an apocalyptic number.
114014352 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
114014352 is an abundant number, since it is smaller than the sum of its proper divisors (180522848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114014352 is a wasteful number, since it uses less digits than its factorization.
114014352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2375310 (or 2375304 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 21.
The square root of 114014352 is about 10677.7503248578. The cubic root of 114014352 is about 484.9011057086.
Adding to 114014352 its reverse (253410411), we get a palindrome (367424763).
It can be divided in two parts, 11401 and 4352, that added together give a triangular number (15753 = T177).
The spelling of 114014352 in words is "one hundred fourteen million, fourteen thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •