Base | Representation |
---|---|
bin | 11010101001000110… |
… | …10011010011001000 |
3 | 1100220211110010220120 |
4 | 31110203103103020 |
5 | 213243140121440 |
6 | 10323152223240 |
7 | 1014311152302 |
oct | 152443232310 |
9 | 40824403816 |
10 | 14303442120 |
11 | 607aa13850 |
12 | 293223ab20 |
13 | 146c443626 |
14 | 999904972 |
15 | 58aac1dd0 |
hex | 3548d34c8 |
14303442120 has 128 divisors (see below), whose sum is σ = 46843367040. Its totient is φ = 3465123840.
The previous prime is 14303442071. The next prime is 14303442143. The reversal of 14303442120 is 2124430341.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2628042 + ... + 2633478.
It is an arithmetic number, because the mean of its divisors is an integer number (365963805).
Almost surely, 214303442120 is an apocalyptic number.
14303442120 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 14303442120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23421683520).
14303442120 is an abundant number, since it is smaller than the sum of its proper divisors (32539924920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14303442120 is a wasteful number, since it uses less digits than its factorization.
14303442120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7455 (or 7451 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 14303442120 its reverse (2124430341), we get a palindrome (16427872461).
The spelling of 14303442120 in words is "fourteen billion, three hundred three million, four hundred forty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •