Base | Representation |
---|---|
bin | 1001100110110010… |
… | …11001100100110000 |
3 | 111022102022010202100 |
4 | 10303121121210300 |
5 | 41030224414124 |
6 | 2211430020400 |
7 | 241542006060 |
oct | 46331314460 |
9 | 14272263670 |
10 | 5157263664 |
11 | 2207160583 |
12 | bbb1a7700 |
13 | 642601a07 |
14 | 36cd1b3a0 |
15 | 202b6d1c9 |
hex | 133659930 |
5157263664 has 240 divisors, whose sum is σ = 17155600384. Its totient is φ = 1415232000.
The previous prime is 5157263659. The next prime is 5157263677. The reversal of 5157263664 is 4663627515.
5157263664 is a `hidden beast` number, since 5 + 1 + 5 + 7 + 2 + 636 + 6 + 4 = 666.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
Its product of digits (907200) is a multiple of the sum of its prime factors (1296).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4717902 + ... + 4718994.
Almost surely, 25157263664 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 5157263664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8577800192).
5157263664 is an abundant number, since it is smaller than the sum of its proper divisors (11998336720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5157263664 is a wasteful number, since it uses less digits than its factorization.
5157263664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1296 (or 1287 counting only the distinct ones).
The product of its digits is 907200, while the sum is 45.
The square root of 5157263664 is about 71814.0909849871. The cubic root of 5157263664 is about 1727.7190097376.
The spelling of 5157263664 in words is "five billion, one hundred fifty-seven million, two hundred sixty-three thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •