Base | Representation |
---|---|
bin | 1000101110101111011… |
… | …0111100010000011000 |
3 | 112100010210000000020210 |
4 | 2023223312330100120 |
5 | 4424132344431113 |
6 | 152522543051120 |
7 | 13556535265350 |
oct | 2135366742030 |
9 | 470123000223 |
10 | 149985936408 |
11 | 58677172a50 |
12 | 25099ba0aa0 |
13 | 111b36970c9 |
14 | 738b96db60 |
15 | 3d7c7526c3 |
hex | 22ebdbc418 |
149985936408 has 64 divisors (see below), whose sum is σ = 467488638720. Its totient is φ = 38957385600.
The previous prime is 149985936383. The next prime is 149985936421. The reversal of 149985936408 is 804639589941.
149985936408 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1499859364082 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (66).
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 15 ways as a sum of consecutive naturals, for example, 40578763 + ... + 40582458.
It is an arithmetic number, because the mean of its divisors is an integer number (7304509980).
Almost surely, 2149985936408 is an apocalyptic number.
It is an amenable number.
149985936408 is an abundant number, since it is smaller than the sum of its proper divisors (317502702312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
149985936408 is a wasteful number, since it uses less digits than its factorization.
149985936408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81161248 (or 81161244 counting only the distinct ones).
The product of its (nonzero) digits is 67184640, while the sum is 66.
The spelling of 149985936408 in words is "one hundred forty-nine billion, nine hundred eighty-five million, nine hundred thirty-six thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •