Base | Representation |
---|---|
bin | 11011011000101001… |
… | …11010001000110100 |
3 | 1101221122000100112220 |
4 | 31230110322020310 |
5 | 220102243302403 |
6 | 10430521442340 |
7 | 1030223451126 |
oct | 155424721064 |
9 | 41848010486 |
10 | 14702322228 |
11 | 6265094330 |
12 | 2a239403b0 |
13 | 1503c82269 |
14 | 9d6897216 |
15 | 5b0b13953 |
hex | 36c53a234 |
14702322228 has 96 divisors (see below), whose sum is σ = 39754810368. Its totient is φ = 4179494400.
The previous prime is 14702322221. The next prime is 14702322233. The reversal of 14702322228 is 82222320741.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14702322221) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 687351 + ... + 708417.
It is an arithmetic number, because the mean of its divisors is an integer number (414112608).
Almost surely, 214702322228 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14702322228, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19877405184).
14702322228 is an abundant number, since it is smaller than the sum of its proper divisors (25052488140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14702322228 is a wasteful number, since it uses less digits than its factorization.
14702322228 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21413 (or 21411 counting only the distinct ones).
The product of its (nonzero) digits is 21504, while the sum is 33.
Adding to 14702322228 its reverse (82222320741), we get a palindrome (96924642969).
The spelling of 14702322228 in words is "fourteen billion, seven hundred two million, three hundred twenty-two thousand, two hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •