Base | Representation |
---|---|
bin | 111111010110000101… |
… | …0101011010111110000 |
3 | 111000010100002021211220 |
4 | 1332230022223113300 |
5 | 4212043302411131 |
6 | 142254211505040 |
7 | 12554003613000 |
oct | 1765412532760 |
9 | 430110067756 |
10 | 136032466416 |
11 | 52766865470 |
12 | 22444bb8180 |
13 | ca9b8ca0a2 |
14 | 682672a000 |
15 | 3812760e96 |
hex | 1fac2ab5f0 |
136032466416 has 640 divisors, whose sum is σ = 471398400000. Its totient is φ = 33460116480.
The previous prime is 136032466391. The next prime is 136032466421. The reversal of 136032466416 is 614664230631.
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 127 ways as a sum of consecutive naturals, for example, 309868725 + ... + 309869163.
It is an arithmetic number, because the mean of its divisors is an integer number (736560000).
Almost surely, 2136032466416 is an apocalyptic number.
136032466416 is a gapful number since it is divisible by the number (16) 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 136032466416, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (235699200000).
136032466416 is an abundant number, since it is smaller than the sum of its proper divisors (335365933584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136032466416 is a wasteful number, since it uses less digits than its factorization.
136032466416 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 570 (or 550 counting only the distinct ones).
The product of its (nonzero) digits is 373248, while the sum is 42.
The spelling of 136032466416 in words is "one hundred thirty-six billion, thirty-two million, four hundred sixty-six thousand, four hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •