Base | Representation |
---|---|
bin | 11010101011010101… |
… | …00100010110101000 |
3 | 1100222010121021220110 |
4 | 31111222210112220 |
5 | 213312430433300 |
6 | 10325100454320 |
7 | 1014626022066 |
oct | 152552442650 |
9 | 40863537813 |
10 | 14322124200 |
11 | 608a51398a |
12 | 293854a3a0 |
13 | 1473284c07 |
14 | 99c1a9036 |
15 | 58c562550 |
hex | 355aa45a8 |
14322124200 has 96 divisors (see below), whose sum is σ = 44513445600. Its totient is φ = 3809352960.
The previous prime is 14322124139. The next prime is 14322124207. The reversal of 14322124200 is 242122341.
It is not an unprimeable number, because it can be changed into a prime (14322124207) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 202719 + ... + 264081.
It is an arithmetic number, because the mean of its divisors is an integer number (463681725).
Almost surely, 214322124200 is an apocalyptic number.
14322124200 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 14322124200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22256722800).
14322124200 is an abundant number, since it is smaller than the sum of its proper divisors (30191321400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14322124200 is a wasteful number, since it uses less digits than its factorization.
14322124200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61771 (or 61762 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 14322124200 its reverse (242122341), we get a palindrome (14564246541).
The spelling of 14322124200 in words is "fourteen billion, three hundred twenty-two million, one hundred twenty-four thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •