Base | Representation |
---|---|
bin | 1001001010110001… |
… | …1100110000000000 |
3 | 20100112001010200012 |
4 | 2102230130300000 |
5 | 20020022010012 |
6 | 1044114244052 |
7 | 114663136250 |
oct | 22254346000 |
9 | 6315033605 |
10 | 2461125632 |
11 | 1053272129 |
12 | 588286628 |
13 | 302b6b074 |
14 | 194c11960 |
15 | e60ec622 |
hex | 92b1cc00 |
2461125632 has 176 divisors, whose sum is σ = 6272663040. Its totient is φ = 939589632.
The previous prime is 2461125617. The next prime is 2461125647. The reversal of 2461125632 is 2365211642.
It is an interprime number because it is at equal distance from previous prime (2461125617) and next prime (2461125647).
It is a Harshad number since it is a multiple of its sum of digits (32).
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 15 ways as a sum of consecutive naturals, for example, 2314733 + ... + 2315795.
Almost surely, 22461125632 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 2461125632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3136331520).
2461125632 is an abundant number, since it is smaller than the sum of its proper divisors (3811537408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2461125632 is a wasteful number, since it uses less digits than its factorization.
2461125632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1126 (or 1108 counting only the distinct ones).
The product of its digits is 17280, while the sum is 32.
The square root of 2461125632 is about 49609.7332385491. The cubic root of 2461125632 is about 1350.1372758439.
The spelling of 2461125632 in words is "two billion, four hundred sixty-one million, one hundred twenty-five thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •