Base | Representation |
---|---|
bin | 101000001101010111111… |
… | …1111110000110000100101 |
3 | 201120022022000001012202221 |
4 | 1100122233333300300211 |
5 | 1211020310322421440 |
6 | 15430423245432341 |
7 | 1110155246435416 |
oct | 120325777606045 |
9 | 21508260035687 |
10 | 5526280670245 |
11 | 1840756406545 |
12 | 75304426b6b1 |
13 | 311183b7619a |
14 | 15168b08180d |
15 | 98b40699d4a |
hex | 506afff0c25 |
5526280670245 has 16 divisors (see below), whose sum is σ = 6870717388800. Its totient is φ = 4262623315200.
The previous prime is 5526280670243. The next prime is 5526280670279. The reversal of 5526280670245 is 5420760826255.
It is not a de Polignac number, because 5526280670245 - 21 = 5526280670243 is a prime.
It is a super-4 number, since 4×55262806702454 (a number of 52 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5526280670192 and 5526280670201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5526280670243) 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 15 ways as a sum of consecutive naturals, for example, 65739220 + ... + 65823229.
It is an arithmetic number, because the mean of its divisors is an integer number (429419836800).
Almost surely, 25526280670245 is an apocalyptic number.
It is an amenable number.
5526280670245 is a deficient number, since it is larger than the sum of its proper divisors (1344436718555).
5526280670245 is a wasteful number, since it uses less digits than its factorization.
5526280670245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131562756.
The product of its (nonzero) digits is 8064000, while the sum is 52.
The spelling of 5526280670245 in words is "five trillion, five hundred twenty-six billion, two hundred eighty million, six hundred seventy thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •