Base | Representation |
---|---|
bin | 110101001100110011… |
… | …1011111001100010000 |
3 | 101220220000210012211011 |
4 | 1222121213133030100 |
5 | 3332434040240440 |
6 | 124252321100304 |
7 | 11153063335315 |
oct | 1523147371420 |
9 | 356800705734 |
10 | 114246415120 |
11 | 444a71396a2 |
12 | 1a184a87694 |
13 | aa091a7386 |
14 | 575b15cd0c |
15 | 2e89ce49ea |
hex | 1a999df310 |
114246415120 has 160 divisors (see below), whose sum is σ = 294456653568. Its totient is φ = 41002942464.
The previous prime is 114246415117. The next prime is 114246415163. The reversal of 114246415120 is 21514642411.
It is a super-2 number, since 2×1142464151202 (a number of 23 digits) contains 22 as substring.
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 31 ways as a sum of consecutive naturals, for example, 9597012 + ... + 9608908.
Almost surely, 2114246415120 is an apocalyptic number.
114246415120 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 114246415120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (147228326784).
114246415120 is an abundant number, since it is smaller than the sum of its proper divisors (180210238448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114246415120 is a wasteful number, since it uses less digits than its factorization.
114246415120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12257 (or 12251 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 31.
The spelling of 114246415120 in words is "one hundred fourteen billion, two hundred forty-six million, four hundred fifteen thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •