Base | Representation |
---|---|
bin | 100101010110010111110… |
… | …011000110111100001101 |
3 | 100002100221201011202211012 |
4 | 211112113303012330031 |
5 | 314022440402424401 |
6 | 5243033230335005 |
7 | 353301534005252 |
oct | 45262763067415 |
9 | 10070851152735 |
10 | 2566642233101 |
11 | 8aa5636a0391 |
12 | 35552335a465 |
13 | 15805829ca6b |
14 | 8c324793429 |
15 | 46b6e55c8bb |
hex | 25597cc6f0d |
2566642233101 has 8 divisors (see below), whose sum is σ = 2587141776384. Its totient is φ = 2546147217600.
The previous prime is 2566642233083. The next prime is 2566642233109. The reversal of 2566642233101 is 1013322466652.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2566642233101 - 226 = 2566575124237 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2566642233109) 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 7 ways as a sum of consecutive naturals, for example, 10901 + ... + 2265701.
It is an arithmetic number, because the mean of its divisors is an integer number (323392722048).
Almost surely, 22566642233101 is an apocalyptic number.
It is an amenable number.
2566642233101 is a deficient number, since it is larger than the sum of its proper divisors (20499543283).
2566642233101 is a wasteful number, since it uses less digits than its factorization.
2566642233101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2263891.
The product of its (nonzero) digits is 311040, while the sum is 41.
Adding to 2566642233101 its reverse (1013322466652), we get a palindrome (3579964699753).
The spelling of 2566642233101 in words is "two trillion, five hundred sixty-six billion, six hundred forty-two million, two hundred thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •