Base | Representation |
---|---|
bin | 110111001111… |
… | …111100100000 |
3 | 1000020211021000 |
4 | 313033330200 |
5 | 12201430412 |
6 | 1234232000 |
7 | 234051111 |
oct | 67177440 |
9 | 30224230 |
10 | 14483232 |
11 | 81a2515 |
12 | 4a25600 |
13 | 300137a |
14 | 1cd0208 |
15 | 14114dc |
hex | dcff20 |
14483232 has 48 divisors (see below), whose sum is σ = 42245280. Its totient is φ = 4827456.
The previous prime is 14483213. The next prime is 14483233. The reversal of 14483232 is 23238441.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a nude number because it is divisible by every one of its digits.
It is a junction number, because it is equal to n+sod(n) for n = 14483196 and 14483205.
It is not an unprimeable number, because it can be changed into a prime (14483233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7518 + ... + 9245.
It is an arithmetic number, because the mean of its divisors is an integer number (880110).
Almost surely, 214483232 is an apocalyptic number.
14483232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14483232 is an abundant number, since it is smaller than the sum of its proper divisors (27762048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14483232 is a wasteful number, since it uses less digits than its factorization.
14483232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16782 (or 16768 counting only the distinct ones).
The product of its digits is 4608, while the sum is 27.
The square root of 14483232 is about 3805.6841697650. The cubic root of 14483232 is about 243.7559146494.
The spelling of 14483232 in words is "fourteen million, four hundred eighty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •