Base | Representation |
---|---|
bin | 111110011011111101… |
… | …0010011110101100000 |
3 | 110211002101222021111222 |
4 | 1330313322103311200 |
5 | 4144044444044111 |
6 | 141332454554212 |
7 | 12454451232245 |
oct | 1746772236540 |
9 | 424071867458 |
10 | 134082018656 |
11 | 51955893173 |
12 | 21b9b968968 |
13 | c84a7b23a1 |
14 | 66bd68d5cc |
15 | 374b3da7db |
hex | 1f37e93d60 |
134082018656 has 96 divisors (see below), whose sum is σ = 283983174720. Its totient is φ = 62089216000.
The previous prime is 134082018643. The next prime is 134082018671. The reversal of 134082018656 is 656810280431.
It is a super-3 number, since 3×1340820186563 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21974006 + ... + 21980106.
It is an arithmetic number, because the mean of its divisors is an integer number (2958158070).
Almost surely, 2134082018656 is an apocalyptic number.
134082018656 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 134082018656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (141991587360).
134082018656 is an abundant number, since it is smaller than the sum of its proper divisors (149901156064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134082018656 is a wasteful number, since it uses less digits than its factorization.
134082018656 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6768 (or 6760 counting only the distinct ones).
The product of its (nonzero) digits is 276480, while the sum is 44.
The spelling of 134082018656 in words is "one hundred thirty-four billion, eighty-two million, eighteen thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •