Base | Representation |
---|---|
bin | 100101010011111011110… |
… | …000000111110101101100 |
3 | 100002010012020220010221120 |
4 | 211103323300013311230 |
5 | 314002110144022102 |
6 | 5241521345100540 |
7 | 353146624066251 |
oct | 45237360076554 |
9 | 10063166803846 |
10 | 2564024204652 |
11 | 8a943a901909 |
12 | 354b12627750 |
13 | 157a2ba86bc1 |
14 | 8c156bbb428 |
15 | 46a697ba6bc |
hex | 254fbc07d6c |
2564024204652 has 12 divisors (see below), whose sum is σ = 5982723144216. Its totient is φ = 854674734880.
The previous prime is 2564024204641. The next prime is 2564024204659.
2564024204652 is nontrivially palindromic in base 10.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×25640242046522 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2564024204659) 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, 106834341849 + ... + 106834341872.
It is an arithmetic number, because the mean of its divisors is an integer number (498560262018).
Almost surely, 22564024204652 is an apocalyptic number.
It is an amenable number.
2564024204652 is an abundant number, since it is smaller than the sum of its proper divisors (3418698939564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2564024204652 is a wasteful number, since it uses less digits than its factorization.
2564024204652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213668683728 (or 213668683726 counting only the distinct ones).
The product of its (nonzero) digits is 921600, while the sum is 42.
The spelling of 2564024204652 in words is "two trillion, five hundred sixty-four billion, twenty-four million, two hundred four thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •