Base | Representation |
---|---|
bin | 1001110011010101… |
… | …01100100110000000 |
3 | 111120202020201210112 |
4 | 10321222230212000 |
5 | 41234142230222 |
6 | 2230104450452 |
7 | 244260116543 |
oct | 47152544600 |
9 | 14522221715 |
10 | 5262461312 |
11 | 2260582089 |
12 | 102a479a28 |
13 | 65b345244 |
14 | 37cca285a |
15 | 20beecbe2 |
hex | 139aac980 |
5262461312 has 48 divisors (see below), whose sum is σ = 11043096300. Its totient is φ = 2491050240.
The previous prime is 5262461311. The next prime is 5262461317. The reversal of 5262461312 is 2131642625.
It is a super-2 number, since 2×52624613122 = 55386998120593522688, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5262461311) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3576737 + ... + 3578207.
Almost surely, 25262461312 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 5262461312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5521548150).
5262461312 is an abundant number, since it is smaller than the sum of its proper divisors (5780634988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5262461312 is an frugal number, since it uses more digits than its factorization.
5262461312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2975 (or 1492 counting only the distinct ones).
The product of its digits is 17280, while the sum is 32.
The square root of 5262461312 is about 72542.8239869389. The cubic root of 5262461312 is about 1739.3873423290.
The spelling of 5262461312 in words is "five billion, two hundred sixty-two million, four hundred sixty-one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •