Base | Representation |
---|---|
bin | 1001110010001010… |
… | …11100111000110000 |
3 | 111120001212200120100 |
4 | 10321011130320300 |
5 | 41224142311043 |
6 | 2225115312400 |
7 | 244111123212 |
oct | 47105347060 |
9 | 14501780510 |
10 | 5252697648 |
11 | 2256013540 |
12 | 102714b700 |
13 | 659307123 |
14 | 37b8805b2 |
15 | 20b21ecd3 |
hex | 13915ce30 |
5252697648 has 120 divisors (see below), whose sum is σ = 16163536896. Its totient is φ = 1579132800.
The previous prime is 5252697643. The next prime is 5252697673. The reversal of 5252697648 is 8467962525.
5252697648 is a `hidden beast` number, since 5 + 2 + 526 + 9 + 76 + 48 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 5252697594 and 5252697603.
It is not an unprimeable number, because it can be changed into a prime (5252697643) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 188113 + ... + 214223.
Almost surely, 25252697648 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 5252697648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8081768448).
5252697648 is an abundant number, since it is smaller than the sum of its proper divisors (10910839248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5252697648 is a wasteful number, since it uses less digits than its factorization.
5252697648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26263 (or 26254 counting only the distinct ones).
The product of its digits is 7257600, while the sum is 54.
The square root of 5252697648 is about 72475.4968799801. The cubic root of 5252697648 is about 1738.3109570681.
The spelling of 5252697648 in words is "five billion, two hundred fifty-two million, six hundred ninety-seven thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •