Base | Representation |
---|---|
bin | 11010010110010100… |
… | …10000000001001100 |
3 | 1100111211222011111200 |
4 | 31023022100001030 |
5 | 212432321131030 |
6 | 10255403145500 |
7 | 1010355666030 |
oct | 151312200114 |
9 | 40454864450 |
10 | 14145880140 |
11 | 5aa9a87137 |
12 | 28a9515290 |
13 | 14458c77a2 |
14 | 982a0c1c0 |
15 | 57bd4bd60 |
hex | 34b29004c |
14145880140 has 288 divisors, whose sum is σ = 50187586176. Its totient is φ = 3158507520.
The previous prime is 14145880127. The next prime is 14145880181. The reversal of 14145880140 is 4108854141.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 14145880095 and 14145880104.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 10393060 + ... + 10394420.
It is an arithmetic number, because the mean of its divisors is an integer number (174262452).
Almost surely, 214145880140 is an apocalyptic number.
14145880140 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 14145880140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25093793088).
14145880140 is an abundant number, since it is smaller than the sum of its proper divisors (36041706036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14145880140 is a wasteful number, since it uses less digits than its factorization.
14145880140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1569 (or 1564 counting only the distinct ones).
The product of its (nonzero) digits is 20480, while the sum is 36.
The spelling of 14145880140 in words is "fourteen billion, one hundred forty-five million, eight hundred eighty thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •