Base | Representation |
---|---|
bin | 1000101100110100101… |
… | …1111110000000000000 |
3 | 112021210220201120002200 |
4 | 2023031023332000000 |
5 | 4422104131324010 |
6 | 152355521513200 |
7 | 13541016360561 |
oct | 2131513760000 |
9 | 467726646080 |
10 | 149471354880 |
11 | 58432757261 |
12 | 24b757a2800 |
13 | 11130ba7cb3 |
14 | 733d4a0168 |
15 | 3d4c4a8cc0 |
hex | 22cd2fe000 |
149471354880 has 1008 divisors, whose sum is σ = 583753289184. Its totient is φ = 35295068160.
The previous prime is 149471354869. The next prime is 149471354887. The reversal of 149471354880 is 88453174941.
149471354880 is a `hidden beast` number, since 1 + 4 + 9 + 4 + 7 + 13 + 548 + 80 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (149471354887) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 2450350050 + ... + 2450350110.
Almost surely, 2149471354880 is an apocalyptic number.
149471354880 is a gapful number since it is divisible by the number (10) 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 149471354880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (291876644592).
149471354880 is an abundant number, since it is smaller than the sum of its proper divisors (434281934304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
149471354880 is a wasteful number, since it uses less digits than its factorization.
149471354880 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155 (or 111 counting only the distinct ones).
The product of its (nonzero) digits is 3870720, while the sum is 54.
The spelling of 149471354880 in words is "one hundred forty-nine billion, four hundred seventy-one million, three hundred fifty-four thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •