Base | Representation |
---|---|
bin | 11010001010110000… |
… | …00000111010101000 |
3 | 1100021002100020212212 |
4 | 31011120000322220 |
5 | 212232444400000 |
6 | 10242015024252 |
7 | 1005100020320 |
oct | 150530007250 |
9 | 40232306785 |
10 | 14048825000 |
11 | 5a5a217181 |
12 | 2880b0b088 |
13 | 142b775502 |
14 | 973b86280 |
15 | 573579c35 |
hex | 345600ea8 |
14048825000 has 96 divisors (see below), whose sum is σ = 37628841600. Its totient is φ = 4816680000.
The previous prime is 14048824981. The next prime is 14048825003. The reversal of 14048825000 is 52884041.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (14048825003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 134861 + ... + 215139.
It is an arithmetic number, because the mean of its divisors is an integer number (391967100).
Almost surely, 214048825000 is an apocalyptic number.
14048825000 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 14048825000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18814420800).
14048825000 is an abundant number, since it is smaller than the sum of its proper divisors (23580016600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14048825000 is an frugal number, since it uses more digits than its factorization.
14048825000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80317 (or 80293 counting only the distinct ones).
The product of its (nonzero) digits is 10240, while the sum is 32.
The spelling of 14048825000 in words is "fourteen billion, forty-eight million, eight hundred twenty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •