Base | Representation |
---|---|
bin | 1101101001100… |
… | …10100101110000 |
3 | 21222110022012211 |
4 | 12310302211300 |
5 | 213303031000 |
6 | 15210101504 |
7 | 2560152034 |
oct | 664624560 |
9 | 258408184 |
10 | 114502000 |
11 | 596a7058 |
12 | 3241a894 |
13 | 1a950582 |
14 | 112c81c4 |
15 | a0bb7ba |
hex | 6d32970 |
114502000 has 40 divisors (see below), whose sum is σ = 276870672. Its totient is φ = 45800000.
The previous prime is 114501967. The next prime is 114502009. The reversal of 114502000 is 205411.
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×1145020002 = 26221416008000000, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114502009) 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 7 ways as a sum of consecutive naturals, for example, 26626 + ... + 30625.
Almost surely, 2114502000 is an apocalyptic number.
114502000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
114502000 is an abundant number, since it is smaller than the sum of its proper divisors (162368672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114502000 is an equidigital number, since it uses as much as digits as its factorization.
114502000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57274 (or 57258 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 13.
The square root of 114502000 is about 10700.5607329710. The cubic root of 114502000 is about 485.5914419936.
Adding to 114502000 its reverse (205411), we get a palindrome (114707411).
The spelling of 114502000 in words is "one hundred fourteen million, five hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •