Base | Representation |
---|---|
bin | 110101000110001001… |
… | …0010111011101001000 |
3 | 101220022102222002200221 |
4 | 1222030102113131020 |
5 | 3332004312241400 |
6 | 124214211435424 |
7 | 11144406410200 |
oct | 1521422273510 |
9 | 356272862627 |
10 | 114022774600 |
11 | 443a197a219 |
12 | 1a121bb5b74 |
13 | a9a1a638c7 |
14 | 5739585400 |
15 | 2e7536ac1a |
hex | 1a8c497748 |
114022774600 has 144 divisors (see below), whose sum is σ = 313613521200. Its totient is φ = 38430725760.
The previous prime is 114022774571. The next prime is 114022774631. The reversal of 114022774600 is 6477220411.
It is a happy number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 479599 + ... + 676801.
It is an arithmetic number, because the mean of its divisors is an integer number (2177871675).
Almost surely, 2114022774600 is an apocalyptic number.
114022774600 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 114022774600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (156806760600).
114022774600 is an abundant number, since it is smaller than the sum of its proper divisors (199590746600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114022774600 is a wasteful number, since it uses less digits than its factorization.
114022774600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 197292 (or 197276 counting only the distinct ones).
The product of its (nonzero) digits is 18816, while the sum is 34.
The spelling of 114022774600 in words is "one hundred fourteen billion, twenty-two million, seven hundred seventy-four thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •