Base | Representation |
---|---|
bin | 1101101000100… |
… | …01101000111100 |
3 | 21222012110002011 |
4 | 12310101220330 |
5 | 213234221121 |
6 | 15203141004 |
7 | 2556050410 |
oct | 664215074 |
9 | 258173064 |
10 | 114367036 |
11 | 59614713 |
12 | 32374764 |
13 | 1a904004 |
14 | 11290d40 |
15 | a0917e1 |
hex | 6d11a3c |
114367036 has 48 divisors (see below), whose sum is σ = 233856000. Its totient is φ = 47930688.
The previous prime is 114367031. The next prime is 114367049. The reversal of 114367036 is 630763411.
114367036 is digitally balanced in base 9, because in such base it contains all the possibile digits an equal number of times.
114367036 is strictly pandigital in base 9.
It is a junction number, because it is equal to n+sod(n) for n = 114366989 and 114367007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114367031) 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 15 ways as a sum of consecutive naturals, for example, 329415 + ... + 329761.
It is an arithmetic number, because the mean of its divisors is an integer number (4872000).
Almost surely, 2114367036 is an apocalyptic number.
It is an amenable number.
114367036 is an abundant number, since it is smaller than the sum of its proper divisors (119488964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114367036 is a wasteful number, since it uses less digits than its factorization.
114367036 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 586 (or 584 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 31.
The square root of 114367036 is about 10694.2524750447. The cubic root of 114367036 is about 485.4005774091.
The spelling of 114367036 in words is "one hundred fourteen million, three hundred sixty-seven thousand, thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •