Base | Representation |
---|---|
bin | 11010010000111111… |
… | …10100100010110000 |
3 | 1100101201220100011020 |
4 | 31020133310202300 |
5 | 212334401444440 |
6 | 10251125415440 |
7 | 1006304151234 |
oct | 151037644260 |
9 | 40351810136 |
10 | 14101203120 |
11 | 5a86841684 |
12 | 289656a580 |
13 | 1439584194 |
14 | 97aadc5c4 |
15 | 577e743d0 |
hex | 3487f48b0 |
14101203120 has 160 divisors (see below), whose sum is σ = 45192536064. Its totient is φ = 3633484800.
The previous prime is 14101203119. The next prime is 14101203133. The reversal of 14101203120 is 2130210141.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 14101203120.
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, 7535785 + ... + 7537655.
Almost surely, 214101203120 is an apocalyptic number.
14101203120 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 14101203120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22596268032).
14101203120 is an abundant number, since it is smaller than the sum of its proper divisors (31091332944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14101203120 is a wasteful number, since it uses less digits than its factorization.
14101203120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2931 (or 2925 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 14101203120 its reverse (2130210141), we get a palindrome (16231413261).
The spelling of 14101203120 in words is "fourteen billion, one hundred one million, two hundred three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •