Base | Representation |
---|---|
bin | 11010101100011001… |
… | …10010110000111000 |
3 | 1100222202111010001210 |
4 | 31112030302300320 |
5 | 213322230033440 |
6 | 10330021043120 |
7 | 1015065210225 |
oct | 152614626070 |
9 | 40882433053 |
10 | 14331096120 |
11 | 60945916a0 |
12 | 293b5564a0 |
13 | 14750a6843 |
14 | 99d46294c |
15 | 58d235a80 |
hex | 356332c38 |
14331096120 has 256 divisors, whose sum is σ = 48410265600. Its totient is φ = 3364208640.
The previous prime is 14331096107. The next prime is 14331096127. The reversal of 14331096120 is 2169013341.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14331096127) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5525544 + ... + 5528136.
It is an arithmetic number, because the mean of its divisors is an integer number (189102600).
Almost surely, 214331096120 is an apocalyptic number.
14331096120 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 14331096120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24205132800).
14331096120 is an abundant number, since it is smaller than the sum of its proper divisors (34079169480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14331096120 is a wasteful number, since it uses less digits than its factorization.
14331096120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2750 (or 2746 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 30.
The spelling of 14331096120 in words is "fourteen billion, three hundred thirty-one million, ninety-six thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •