Base | Representation |
---|---|
bin | 100101010100101110000… |
… | …111011111101000100111 |
3 | 100002012101010212221222211 |
4 | 211110232013133220213 |
5 | 314010323003122411 |
6 | 5242141252104251 |
7 | 353206564263013 |
oct | 45245607375047 |
9 | 10065333787884 |
10 | 2564869192231 |
11 | 8a983387a555 |
12 | 355109605087 |
13 | 157b34b5b858 |
14 | 8c1d70d7543 |
15 | 46ab8a7c221 |
hex | 2552e1dfa27 |
2564869192231 has 4 divisors (see below), whose sum is σ = 2571857936992. Its totient is φ = 2557880447472.
The previous prime is 2564869192147. The next prime is 2564869192243. The reversal of 2564869192231 is 1322919684652.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2564869192231 - 213 = 2564869184039 is a prime.
It is a super-2 number, since 2×25648691922312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2564869192531) 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, 3494371830 + ... + 3494372563.
It is an arithmetic number, because the mean of its divisors is an integer number (642964484248).
Almost surely, 22564869192231 is an apocalyptic number.
2564869192231 is a deficient number, since it is larger than the sum of its proper divisors (6988744761).
2564869192231 is an equidigital number, since it uses as much as digits as its factorization.
2564869192231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6988744760.
The product of its digits is 11197440, while the sum is 58.
The spelling of 2564869192231 in words is "two trillion, five hundred sixty-four billion, eight hundred sixty-nine million, one hundred ninety-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •