Base | Representation |
---|---|
bin | 11100110001111… |
… | …00101011010100 |
3 | 121211021110100222 |
4 | 32120330223110 |
5 | 443300433022 |
6 | 35542253512 |
7 | 5661021230 |
oct | 1630745324 |
9 | 554243328 |
10 | 241421012 |
11 | 1143041a8 |
12 | 68a27298 |
13 | 3b02a891 |
14 | 240c55c0 |
15 | 162dc242 |
hex | e63cad4 |
241421012 has 48 divisors (see below), whose sum is σ = 513370368. Its totient is φ = 96975360.
The previous prime is 241421009. The next prime is 241421017. The reversal of 241421012 is 210124142.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (241421017) 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, 130937 + ... + 132767.
It is an arithmetic number, because the mean of its divisors is an integer number (10695216).
Almost surely, 2241421012 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 241421012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (256685184).
241421012 is an abundant number, since it is smaller than the sum of its proper divisors (271949356).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
241421012 is a wasteful number, since it uses less digits than its factorization.
241421012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2136 (or 2134 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 17.
The square root of 241421012 is about 15537.7286628387. The cubic root of 241421012 is about 622.6705925366.
Adding to 241421012 its reverse (210124142), we get a palindrome (451545154).
The spelling of 241421012 in words is "two hundred forty-one million, four hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •