Base | Representation |
---|---|
bin | 11010101011101011… |
… | …01111001010010010 |
3 | 1100222100010001011100 |
4 | 31111311233022102 |
5 | 213314203131200 |
6 | 10325243325230 |
7 | 1014662635101 |
oct | 152565571222 |
9 | 40870101140 |
10 | 14325052050 |
11 | 60911336a1 |
12 | 2939520816 |
13 | 1473a6b77a |
14 | 99c72c038 |
15 | 58c93ed00 |
hex | 355d6f292 |
14325052050 has 144 divisors (see below), whose sum is σ = 40333632768. Its totient is φ = 3638131200.
The previous prime is 14325052003. The next prime is 14325052081. The reversal of 14325052050 is 5025052341.
It is a happy number.
14325052050 is a `hidden beast` number, since 1 + 43 + 2 + 50 + 520 + 50 = 666.
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 71 ways as a sum of consecutive naturals, for example, 2491479 + ... + 2497221.
It is an arithmetic number, because the mean of its divisors is an integer number (280094672).
Almost surely, 214325052050 is an apocalyptic number.
14325052050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 14325052050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20166816384).
14325052050 is an abundant number, since it is smaller than the sum of its proper divisors (26008580718).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14325052050 is a wasteful number, since it uses less digits than its factorization.
14325052050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6025 (or 6017 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 27.
The spelling of 14325052050 in words is "fourteen billion, three hundred twenty-five million, fifty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •