Base | Representation |
---|---|
bin | 1001000001010101… |
… | …0101110000010000 |
3 | 20020202111121200021 |
4 | 2100111111300100 |
5 | 14424401410412 |
6 | 1040141233224 |
7 | 114002344225 |
oct | 22025256020 |
9 | 6222447607 |
10 | 2421513232 |
11 | 1032976806 |
12 | 576b62814 |
13 | 2c78aba88 |
14 | 18d85d94c |
15 | e28c5607 |
hex | 90555c10 |
2421513232 has 40 divisors (see below), whose sum is σ = 4911542784. Its totient is φ = 1154360064.
The previous prime is 2421513181. The next prime is 2421513247. The reversal of 2421513232 is 2323151242.
It is a junction number, because it is equal to n+sod(n) for n = 2421513197 and 2421513206.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 104673 + ... + 125695.
Almost surely, 22421513232 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 2421513232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2455771392).
2421513232 is an abundant number, since it is smaller than the sum of its proper divisors (2490029552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2421513232 is a wasteful number, since it uses less digits than its factorization.
2421513232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21367 (or 21361 counting only the distinct ones).
The product of its digits is 2880, while the sum is 25.
The square root of 2421513232 is about 49208.8735087484. The cubic root of 2421513232 is about 1342.8544690369.
Adding to 2421513232 its reverse (2323151242), we get a palindrome (4744664474).
The spelling of 2421513232 in words is "two billion, four hundred twenty-one million, five hundred thirteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •