Base | Representation |
---|---|
bin | 110101001111111110… |
… | …0011010100111100000 |
3 | 101221011102112011200020 |
4 | 1222133330122213200 |
5 | 3333143224032304 |
6 | 124311032153440 |
7 | 11155522522320 |
oct | 1523774324740 |
9 | 357142464606 |
10 | 114352564704 |
11 | 44551050424 |
12 | 1a1b4538880 |
13 | aa25191c91 |
14 | 576b2b1280 |
15 | 2e942b15d9 |
hex | 1a9ff1a9e0 |
114352564704 has 192 divisors, whose sum is σ = 351812160000. Its totient is φ = 31840174080.
The previous prime is 114352564691. The next prime is 114352564727. The reversal of 114352564704 is 407465253411.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 34410787 + ... + 34414109.
It is an arithmetic number, because the mean of its divisors is an integer number (1832355000).
Almost surely, 2114352564704 is an apocalyptic number.
114352564704 is a gapful number since it is divisible by the number (14) 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 114352564704, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (175906080000).
114352564704 is an abundant number, since it is smaller than the sum of its proper divisors (237459595296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114352564704 is a wasteful number, since it uses less digits than its factorization.
114352564704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4633 (or 4625 counting only the distinct ones).
The product of its (nonzero) digits is 403200, while the sum is 42.
The spelling of 114352564704 in words is "one hundred fourteen billion, three hundred fifty-two million, five hundred sixty-four thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •