Base | Representation |
---|---|
bin | 100110001100110101101… |
… | …1011111101011111000000 |
3 | 200120220211010101201012202 |
4 | 1030121223123331133000 |
5 | 1142010004121340202 |
6 | 15055533244412332 |
7 | 1051214103101624 |
oct | 114315333753700 |
9 | 20526733351182 |
10 | 5250252527552 |
11 | 174468a75046a |
12 | 70964ab470a8 |
13 | 2c113456c136 |
14 | 142183931184 |
15 | 918877bd802 |
hex | 4c66b6fd7c0 |
5250252527552 has 56 divisors (see below), whose sum is σ = 10875021684000. Its totient is φ = 2510164647936.
The previous prime is 5250252527519. The next prime is 5250252527599. The reversal of 5250252527552 is 2557252520525.
It is a happy number.
It is a super-2 number, since 2×52502525275522 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5250252527497 and 5250252527506.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3903224 + ... + 5073032.
Almost surely, 25250252527552 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 5250252527552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5437510842000).
5250252527552 is an abundant number, since it is smaller than the sum of its proper divisors (5624769156448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5250252527552 is a wasteful number, since it uses less digits than its factorization.
5250252527552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1172893 (or 1172883 counting only the distinct ones).
The product of its (nonzero) digits is 3500000, while the sum is 47.
The spelling of 5250252527552 in words is "five trillion, two hundred fifty billion, two hundred fifty-two million, five hundred twenty-seven thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •