Base | Representation |
---|---|
bin | 111111100011111010… |
… | …1101010011010001100 |
3 | 111001022200122210100120 |
4 | 1333013311222122030 |
5 | 4214021130011000 |
6 | 142412234224540 |
7 | 12601341654351 |
oct | 1770765523214 |
9 | 431280583316 |
10 | 136496719500 |
11 | 529849266a9 |
12 | 22554585150 |
13 | cb43b4745b |
14 | 686c258628 |
15 | 383d3b76a0 |
hex | 1fc7d6a68c |
136496719500 has 96 divisors (see below), whose sum is σ = 397837300224. Its totient is φ = 36366264000.
The previous prime is 136496719493. The next prime is 136496719501. The reversal of 136496719500 is 5917694631.
It is not an unprimeable number, because it can be changed into a prime (136496719501) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1643985 + ... + 1725015.
It is an arithmetic number, because the mean of its divisors is an integer number (4144138544).
Almost surely, 2136496719500 is an apocalyptic number.
136496719500 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 136496719500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (198918650112).
136496719500 is an abundant number, since it is smaller than the sum of its proper divisors (261340580724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136496719500 is a wasteful number, since it uses less digits than its factorization.
136496719500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82176 (or 82164 counting only the distinct ones).
The product of its (nonzero) digits is 1224720, while the sum is 51.
The spelling of 136496719500 in words is "one hundred thirty-six billion, four hundred ninety-six million, seven hundred nineteen thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •