Base | Representation |
---|---|
bin | 101100010000011111000 |
3 | 2201200100022 |
4 | 11202003320 |
5 | 332401412 |
6 | 51030012 |
7 | 15220040 |
oct | 5420370 |
9 | 2650308 |
10 | 1450232 |
11 | 900643 |
12 | 59b308 |
13 | 3ba134 |
14 | 29a720 |
15 | 1d9a72 |
hex | 1620f8 |
1450232 has 64 divisors (see below), whose sum is σ = 3456000. Its totient is φ = 556416.
The previous prime is 1450231. The next prime is 1450237. The reversal of 1450232 is 2320541.
It is a self number, because there is not a number n which added to its sum of digits gives 1450232.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1450231) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30833 + ... + 30879.
It is an arithmetic number, because the mean of its divisors is an integer number (54000).
21450232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1450232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1728000).
1450232 is an abundant number, since it is smaller than the sum of its proper divisors (2005768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1450232 is a wasteful number, since it uses less digits than its factorization.
1450232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108 (or 104 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 17.
The square root of 1450232 is about 1204.2557867829. The cubic root of 1450232 is about 113.1911558141.
Adding to 1450232 its reverse (2320541), we get a palindrome (3770773).
It can be divided in two parts, 1450 and 232, that multiplied together give a square (336400 = 5802).
The spelling of 1450232 in words is "one million, four hundred fifty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •