Base | Representation |
---|---|
bin | 11011110110000100… |
… | …11011011010000000 |
3 | 1102120211102210101201 |
4 | 31323002123122000 |
5 | 221103434323000 |
6 | 10511215510544 |
7 | 1036311362611 |
oct | 157302333200 |
9 | 42524383351 |
10 | 14949136000 |
11 | 6381441157 |
12 | 2a92528454 |
13 | 154314a606 |
14 | a1b583c08 |
15 | 5c761896a |
hex | 37b09b680 |
14949136000 has 128 divisors (see below), whose sum is σ = 37312526160. Its totient is φ = 5956300800.
The previous prime is 14949135961. The next prime is 14949136003. The reversal of 14949136000 is 63194941.
It can be written as a sum of positive squares in 8 ways, for example, as 1683625024 + 13265510976 = 41032^2 + 115176^2 .
It is a tau number, because it is divible by the number of its divisors (128).
It is not an unprimeable number, because it can be changed into a prime (14949136003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4430314 + ... + 4433686.
Almost surely, 214949136000 is an apocalyptic number.
14949136000 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 14949136000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18656263080).
14949136000 is an abundant number, since it is smaller than the sum of its proper divisors (22363390160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14949136000 is an equidigital number, since it uses as much as digits as its factorization.
14949136000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3679 (or 3657 counting only the distinct ones).
The product of its (nonzero) digits is 23328, while the sum is 37.
The spelling of 14949136000 in words is "fourteen billion, nine hundred forty-nine million, one hundred thirty-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •