Base | Representation |
---|---|
bin | 1000101011101011101… |
… | …1001100110000000000 |
3 | 112021000120012112122000 |
4 | 2022322323030300000 |
5 | 4420442213001320 |
6 | 152305254544000 |
7 | 13530306213300 |
oct | 2127273146000 |
9 | 467016175560 |
10 | 149164968960 |
11 | 58295810a57 |
12 | 24aab068000 |
13 | 110b2582657 |
14 | 7310907600 |
15 | 3d30637c90 |
hex | 22baeccc00 |
149164968960 has 1584 divisors, whose sum is σ = 661485921120. Its totient is φ = 31770869760.
The previous prime is 149164968937. The next prime is 149164968977. The reversal of 149164968960 is 69869461941.
149164968960 is a `hidden beast` number, since 1 + 4 + 9 + 1 + 6 + 496 + 89 + 60 = 666.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 2445327330 + ... + 2445327390.
Almost surely, 2149164968960 is an apocalyptic number.
149164968960 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 149164968960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (330742960560).
149164968960 is an abundant number, since it is smaller than the sum of its proper divisors (512320952160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
149164968960 is a wasteful number, since it uses less digits than its factorization.
149164968960 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147 (or 97 counting only the distinct ones).
The product of its (nonzero) digits is 20155392, while the sum is 63.
The spelling of 149164968960 in words is "one hundred forty-nine billion, one hundred sixty-four million, nine hundred sixty-eight thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •