Base | Representation |
---|---|
bin | 110101011111011101… |
… | …0010000110100110000 |
3 | 101222111122002222220000 |
4 | 1222332322100310300 |
5 | 3340224224002000 |
6 | 124434351350000 |
7 | 11204431455066 |
oct | 1527672206460 |
9 | 358448088800 |
10 | 114872094000 |
11 | 44798336484 |
12 | 1a31a522300 |
13 | aaa89c4171 |
14 | 57ba2ac036 |
15 | 2ec4bd6000 |
hex | 1abee90d30 |
114872094000 has 800 divisors, whose sum is σ = 448192046016. Its totient is φ = 28250726400.
The previous prime is 114872093971. The next prime is 114872094019. The reversal of 114872094000 is 490278411.
114872094000 is a `hidden beast` number, since 1 + 1 + 48 + 7 + 209 + 400 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 145961607 + ... + 145962393.
Almost surely, 2114872094000 is an apocalyptic number.
114872094000 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 114872094000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (224096023008).
114872094000 is an abundant number, since it is smaller than the sum of its proper divisors (333319952016).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114872094000 is a wasteful number, since it uses less digits than its factorization.
114872094000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 892 (or 867 counting only the distinct ones).
The product of its (nonzero) digits is 16128, while the sum is 36.
The spelling of 114872094000 in words is "one hundred fourteen billion, eight hundred seventy-two million, ninety-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •