Base | Representation |
---|---|
bin | 11010101000111011… |
… | …11011000100010110 |
3 | 1100220201210111210110 |
4 | 31110131323010112 |
5 | 213242310012100 |
6 | 10323102103450 |
7 | 1014263160510 |
oct | 152435730426 |
9 | 40821714713 |
10 | 14302032150 |
11 | 607a14048a |
12 | 293187ab86 |
13 | 146c06b923 |
14 | 999658bb0 |
15 | 58a8e4250 |
hex | 35477b116 |
14302032150 has 96 divisors (see below), whose sum is σ = 40566689280. Its totient is φ = 3266565120.
The previous prime is 14302032149. The next prime is 14302032161. The reversal of 14302032150 is 5123020341.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1632582 + ... + 1641318.
It is an arithmetic number, because the mean of its divisors is an integer number (422569680).
Almost surely, 214302032150 is an apocalyptic number.
14302032150 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 14302032150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20283344640).
14302032150 is an abundant number, since it is smaller than the sum of its proper divisors (26264657130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14302032150 is a wasteful number, since it uses less digits than its factorization.
14302032150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10318 (or 10313 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 21.
Adding to 14302032150 its reverse (5123020341), we get a palindrome (19425052491).
The spelling of 14302032150 in words is "fourteen billion, three hundred two million, thirty-two thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •