Base | Representation |
---|---|
bin | 1000101110100100100… |
… | …0011111011100001110 |
3 | 112100000120221122000000 |
4 | 2023221020133130032 |
5 | 4424034143032301 |
6 | 152514230545130 |
7 | 13555441500522 |
oct | 2135110373416 |
9 | 470016848000 |
10 | 149940205326 |
11 | 5865337856a |
12 | 250868081a6 |
13 | 111a7074ab2 |
14 | 7385867d82 |
15 | 3d7871c786 |
hex | 22e921f70e |
149940205326 has 448 divisors, whose sum is σ = 398894284800. Its totient is φ = 41903059968.
The previous prime is 149940205313. The next prime is 149940205381. The reversal of 149940205326 is 623502049941.
149940205326 is a `hidden beast` number, since 1 + 4 + 9 + 94 + 0 + 20 + 532 + 6 = 666.
149940205326 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
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 223 ways as a sum of consecutive naturals, for example, 1180631475 + ... + 1180631601.
Almost surely, 2149940205326 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 149940205326, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (199447142400).
149940205326 is an abundant number, since it is smaller than the sum of its proper divisors (248954079474).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
149940205326 is a wasteful number, since it uses less digits than its factorization.
149940205326 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 315 (or 300 counting only the distinct ones).
The product of its (nonzero) digits is 466560, while the sum is 45.
The spelling of 149940205326 in words is "one hundred forty-nine billion, nine hundred forty million, two hundred five thousand, three hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •