Base | Representation |
---|---|
bin | 110101011000100101… |
… | …1101010101001100000 |
3 | 101221220120201120220002 |
4 | 1222301023222221200 |
5 | 3334241243301300 |
6 | 124355443035132 |
7 | 11165634003521 |
oct | 1526113525140 |
9 | 357816646802 |
10 | 114641775200 |
11 | 4468a325567 |
12 | 1a27536baa8 |
13 | aa70082a54 |
14 | 5797876848 |
15 | 2eae88d5d5 |
hex | 1ab12eaa60 |
114641775200 has 72 divisors (see below), whose sum is σ = 280469439432. Its totient is φ = 45758366720.
The previous prime is 114641775197. The next prime is 114641775307. The reversal of 114641775200 is 2577146411.
It is a congruent 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 11 ways as a sum of consecutive naturals, for example, 220172 + ... + 527028.
It is an arithmetic number, because the mean of its divisors is an integer number (3895408881).
Almost surely, 2114641775200 is an apocalyptic number.
114641775200 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 114641775200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (140234719716).
114641775200 is an abundant number, since it is smaller than the sum of its proper divisors (165827664232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114641775200 is a wasteful number, since it uses less digits than its factorization.
114641775200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 307344 (or 307331 counting only the distinct ones).
The product of its (nonzero) digits is 47040, while the sum is 38.
The spelling of 114641775200 in words is "one hundred fourteen billion, six hundred forty-one million, seven hundred seventy-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •