Base | Representation |
---|---|
bin | 101100001101111101100 |
3 | 2201121120110 |
4 | 11201233230 |
5 | 332331230 |
6 | 51020020 |
7 | 15213213 |
oct | 5415754 |
9 | 2647513 |
10 | 1448940 |
11 | 8aa679 |
12 | 59a610 |
13 | 3b967c |
14 | 29a07a |
15 | 1d94b0 |
hex | 161bec |
1448940 has 96 divisors (see below), whose sum is σ = 4515840. Its totient is φ = 345600.
The previous prime is 1448929. The next prime is 1448947. The reversal of 1448940 is 498441.
1448940 = T381 + T382 + ... + T399.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 1448898 and 1448907.
It is not an unprimeable number, because it can be changed into a prime (1448947) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 35320 + ... + 35360.
It is an arithmetic number, because the mean of its divisors is an integer number (47040).
21448940 is an apocalyptic number.
1448940 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 1448940, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2257920).
1448940 is an abundant number, since it is smaller than the sum of its proper divisors (3066900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1448940 is a wasteful number, since it uses less digits than its factorization.
1448940 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 103 (or 101 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 30.
The square root of 1448940 is about 1203.7192363670. The cubic root of 1448940 is about 113.1575321310.
The spelling of 1448940 in words is "one million, four hundred forty-eight thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •