Base | Representation |
---|---|
bin | 101000011111100001101… |
… | …1101110001011110001100 |
3 | 201201000220200022110110112 |
4 | 1100333003131301132030 |
5 | 1212140124033312002 |
6 | 15500351315055152 |
7 | 1113035244400130 |
oct | 120770335613614 |
9 | 21630820273415 |
10 | 5565262010252 |
11 | 185623a35621a |
12 | 75a702ba14b8 |
13 | 314a56b87049 |
14 | 1535082453c0 |
15 | 99b72a16852 |
hex | 50fc377178c |
5565262010252 has 12 divisors (see below), whose sum is σ = 11130524020560. Its totient is φ = 2385112290096.
The previous prime is 5565262010237. The next prime is 5565262010257. The reversal of 5565262010252 is 2520102625655.
5565262010252 is an admirable number.
It is a super-4 number, since 4×55652620102524 (a number of 52 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (5565262010257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 99379678727 + ... + 99379678782.
It is an arithmetic number, because the mean of its divisors is an integer number (927543668380).
Almost surely, 25565262010252 is an apocalyptic number.
It is an amenable number.
5565262010252 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5565262010252 is a wasteful number, since it uses less digits than its factorization.
5565262010252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198759357520 (or 198759357518 counting only the distinct ones).
The product of its (nonzero) digits is 360000, while the sum is 41.
The spelling of 5565262010252 in words is "five trillion, five hundred sixty-five billion, two hundred sixty-two million, ten thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •