Base | Representation |
---|---|
bin | 111111100010011001… |
… | …0000000000100110100 |
3 | 111001012010010220200010 |
4 | 1333010302000010310 |
5 | 4213420012144040 |
6 | 142403203020220 |
7 | 12600150000456 |
oct | 1770462000464 |
9 | 431163126603 |
10 | 136445428020 |
11 | 52958983650 |
12 | 2253b36a670 |
13 | cb36329275 |
14 | 68655062d6 |
15 | 3838b34e80 |
hex | 1fc4c80134 |
136445428020 has 96 divisors (see below), whose sum is σ = 430223302656. Its totient is φ = 32010652800.
The previous prime is 136445427971. The next prime is 136445428037. The reversal of 136445428020 is 20824544631.
It is a super-2 number, since 2×1364454280202 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 136445428020.
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, 3313984 + ... + 3354903.
It is an arithmetic number, because the mean of its divisors is an integer number (4481492736).
Almost surely, 2136445428020 is an apocalyptic number.
136445428020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
136445428020 is an abundant number, since it is smaller than the sum of its proper divisors (293777874636).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136445428020 is a wasteful number, since it uses less digits than its factorization.
136445428020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6668941 (or 6668939 counting only the distinct ones).
The product of its (nonzero) digits is 184320, while the sum is 39.
It can be divided in two parts, 136445 and 428020, that added together give a palindrome (564465).
The spelling of 136445428020 in words is "one hundred thirty-six billion, four hundred forty-five million, four hundred twenty-eight thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •