Base | Representation |
---|---|
bin | 100010000011100111001001… |
… | …110000010110100010110000 |
3 | 201122022222221201221012001010 |
4 | 202003213021300112202300 |
5 | 124113011041012042242 |
6 | 1250320444411310520 |
7 | 43356243060300126 |
oct | 4203471160264260 |
9 | 648288851835033 |
10 | 149781779409072 |
11 | 437a8106745458 |
12 | 14970866a4b440 |
13 | 6576490702ab5 |
14 | 28db6964c9916 |
15 | 124b27b57b89c |
hex | 8839c9c168b0 |
149781779409072 has 80 divisors (see below), whose sum is σ = 409813718537952. Its totient is φ = 46977000345600.
The previous prime is 149781779409049. The next prime is 149781779409077. The reversal of 149781779409072 is 270904977187941.
It is a junction number, because it is equal to n+sod(n) for n = 149781779408985 and 149781779409003.
It is not an unprimeable number, because it can be changed into a prime (149781779409077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23225679 + ... + 28965422.
Almost surely, 2149781779409072 is an apocalyptic number.
149781779409072 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
149781779409072 is an abundant number, since it is smaller than the sum of its proper divisors (260031939128880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
149781779409072 is a wasteful number, since it uses less digits than its factorization.
149781779409072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52194646 (or 52194640 counting only the distinct ones).
The product of its (nonzero) digits is 448084224, while the sum is 75.
The spelling of 149781779409072 in words is "one hundred forty-nine trillion, seven hundred eighty-one billion, seven hundred seventy-nine million, four hundred nine thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •