Base | Representation |
---|---|
bin | 1000101100010100101… |
… | …1011010000010110000 |
3 | 112021110112220002221220 |
4 | 2023011023122002300 |
5 | 4421320232133442 |
6 | 152334321545040 |
7 | 13534465320060 |
oct | 2130513320260 |
9 | 467415802856 |
10 | 149336989872 |
11 | 583739238a4 |
12 | 24b387a5180 |
13 | 1110c0c1785 |
14 | 73296c53a0 |
15 | 3d407b6eec |
hex | 22c52da0b0 |
149336989872 has 160 divisors (see below), whose sum is σ = 467772060672. Its totient is φ = 40077238272.
The previous prime is 149336989859. The next prime is 149336989883. The reversal of 149336989872 is 278989633941.
It is a super-3 number, since 3×1493369898723 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 149336989797 and 149336989806.
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, 2847148 + ... + 2899124.
Almost surely, 2149336989872 is an apocalyptic number.
149336989872 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 149336989872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (233886030336).
149336989872 is an abundant number, since it is smaller than the sum of its proper divisors (318435070800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
149336989872 is a wasteful number, since it uses less digits than its factorization.
149336989872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52515 (or 52509 counting only the distinct ones).
The product of its digits is 141087744, while the sum is 69.
The spelling of 149336989872 in words is "one hundred forty-nine billion, three hundred thirty-six million, nine hundred eighty-nine thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •