Base | Representation |
---|---|
bin | 111110111001111011… |
… | …1110000010011100000 |
3 | 110220200111212111111220 |
4 | 1331303313300103200 |
5 | 4203130010404132 |
6 | 142020352135040 |
7 | 12521414620341 |
oct | 1756367602340 |
9 | 426614774456 |
10 | 135087981792 |
11 | 5232170a165 |
12 | 22220837480 |
13 | c97b02984a |
14 | 67771100c8 |
15 | 37a9898a2c |
hex | 1f73df04e0 |
135087981792 has 96 divisors (see below), whose sum is σ = 368928129024. Its totient is φ = 43233523200.
The previous prime is 135087981781. The next prime is 135087981817. The reversal of 135087981792 is 297189780531.
It is a tau number, because it is divible by the number of its divisors (96).
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, 199242 + ... + 556662.
It is an arithmetic number, because the mean of its divisors is an integer number (3843001344).
Almost surely, 2135087981792 is an apocalyptic number.
135087981792 is a gapful number since it is divisible by the number (12) 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 135087981792, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (184464064512).
135087981792 is an abundant number, since it is smaller than the sum of its proper divisors (233840147232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135087981792 is a wasteful number, since it uses less digits than its factorization.
135087981792 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 357592 (or 357584 counting only the distinct ones).
The product of its (nonzero) digits is 7620480, while the sum is 60.
The spelling of 135087981792 in words is "one hundred thirty-five billion, eighty-seven million, nine hundred eighty-one thousand, seven hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •