Base | Representation |
---|---|
bin | 110101010110001011… |
… | …1010011100000000000 |
3 | 101221200221121201212222 |
4 | 1222230113103200000 |
5 | 3334110100040112 |
6 | 124343434310212 |
7 | 11163632631500 |
oct | 1525427234000 |
9 | 357627551788 |
10 | 114560940032 |
11 | 44648733940 |
12 | 1a252288368 |
13 | aa593bc4a6 |
14 | 578ac33a00 |
15 | 2ea7722372 |
hex | 1aac5d3800 |
114560940032 has 288 divisors, whose sum is σ = 295783488000. Its totient is φ = 43852677120.
The previous prime is 114560940019. The next prime is 114560940049. The reversal of 114560940032 is 230049065411.
It is a super-2 number, since 2×1145609400322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 114560939974 and 114560940001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 65127569 + ... + 65129327.
It is an arithmetic number, because the mean of its divisors is an integer number (1027026000).
Almost surely, 2114560940032 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 114560940032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (147891744000).
114560940032 is an abundant number, since it is smaller than the sum of its proper divisors (181222547968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114560940032 is a wasteful number, since it uses less digits than its factorization.
114560940032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1865 (or 1838 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 35.
The spelling of 114560940032 in words is "one hundred fourteen billion, five hundred sixty million, nine hundred forty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •