Base | Representation |
---|---|
bin | 110101111100… |
… | …101000000000 |
3 | 222121111010000 |
4 | 311330220000 |
5 | 12110020302 |
6 | 1223040000 |
7 | 231130116 |
oct | 65745000 |
9 | 28544100 |
10 | 14141952 |
11 | 7a8a070 |
12 | 48a0000 |
13 | 2c11c26 |
14 | 1c41ab6 |
15 | 139531c |
hex | d7ca00 |
14141952 has 200 divisors, whose sum is σ = 47532672. Its totient is φ = 4147200.
The previous prime is 14141951. The next prime is 14141989. The reversal of 14141952 is 25914141.
It is a Harshad number since it is a multiple of its sum of digits (27).
Its product of digits (1440) is a multiple of the sum of its prime factors (72).
It is not an unprimeable number, because it can be changed into a prime (14141951) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 456177 + ... + 456207.
Almost surely, 214141952 is an apocalyptic number.
14141952 is a gapful number since it is divisible by the number (12) 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 14141952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23766336).
14141952 is an abundant number, since it is smaller than the sum of its proper divisors (33390720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14141952 is an equidigital number, since it uses as much as digits as its factorization.
14141952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72 (or 47 counting only the distinct ones).
The product of its digits is 1440, while the sum is 27.
The square root of 14141952 is about 3760.5786788738. The cubic root of 14141952 is about 241.8260708671.
14141952 divided by its sum of digits (27) gives a triangular number (523776 = T1023).
The spelling of 14141952 in words is "fourteen million, one hundred forty-one thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •