Base | Representation |
---|---|
bin | 111111011101011101… |
… | …1100000110101111000 |
3 | 111000202121010212222120 |
4 | 1332322323200311320 |
5 | 4213100204234433 |
6 | 142334540321240 |
7 | 12563102104506 |
oct | 1767273406570 |
9 | 430677125876 |
10 | 136280149368 |
11 | 52883656320 |
12 | 224b3b43220 |
13 | cb0b00ac4c |
14 | 684b5a1676 |
15 | 38293887b3 |
hex | 1fbaee0d78 |
136280149368 has 64 divisors (see below), whose sum is σ = 373953456000. Its totient is φ = 41043646080.
The previous prime is 136280149363. The next prime is 136280149429. The reversal of 136280149368 is 863941082631.
It is a super-2 number, since 2×1362801493682 (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 136280149368.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136280149361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1540443 + ... + 1626506.
It is an arithmetic number, because the mean of its divisors is an integer number (5843022750).
Almost surely, 2136280149368 is an apocalyptic number.
It is an amenable number.
136280149368 is an abundant number, since it is smaller than the sum of its proper divisors (237673306632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136280149368 is a wasteful number, since it uses less digits than its factorization.
136280149368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3167132 (or 3167128 counting only the distinct ones).
The product of its (nonzero) digits is 1492992, while the sum is 51.
The spelling of 136280149368 in words is "one hundred thirty-six billion, two hundred eighty million, one hundred forty-nine thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •