Base | Representation |
---|---|
bin | 11010000100010010001110… |
… | …111001010100100101100000 |
3 | 120000220211100002110201200201 |
4 | 122010102032321110211200 |
5 | 110011310211100043112 |
6 | 1043454323344554544 |
7 | 33101505610240045 |
oct | 3204221671244540 |
9 | 500824302421621 |
10 | 114643664456032 |
11 | 33590117916458 |
12 | 10a36863322a54 |
13 | 4bc7b0b03700a |
14 | 2044ad665d1cc |
15 | d3c228ab7257 |
hex | 68448ee54960 |
114643664456032 has 48 divisors (see below), whose sum is σ = 231211715060592. Its totient is φ = 55923253166080.
The previous prime is 114643664456023. The next prime is 114643664456033. The reversal of 114643664456032 is 230654466346411.
It is a super-2 number, since 2×1146436644560322 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114643664456033) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 185453568 + ... + 186070720.
It is an arithmetic number, because the mean of its divisors is an integer number (4816910730429).
Almost surely, 2114643664456032 is an apocalyptic number.
It is an amenable number.
114643664456032 is an abundant number, since it is smaller than the sum of its proper divisors (116568050604560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114643664456032 is a wasteful number, since it uses less digits than its factorization.
114643664456032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 758791 (or 758783 counting only the distinct ones).
The product of its (nonzero) digits is 29859840, while the sum is 55.
The spelling of 114643664456032 in words is "one hundred fourteen trillion, six hundred forty-three billion, six hundred sixty-four million, four hundred fifty-six thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •