Base | Representation |
---|---|
bin | 100101011010110111001… |
… | …000001010000110010011 |
3 | 100002211101122221112222022 |
4 | 211122313020022012103 |
5 | 314112323434441201 |
6 | 5245151432202055 |
7 | 353532150155300 |
oct | 45326710120623 |
9 | 10084348845868 |
10 | 2571462812051 |
11 | 9016077a0731 |
12 | 35644983932b |
13 | 158645bcb143 |
14 | 8c660aac0a7 |
15 | 46d5287241b |
hex | 256b720a193 |
2571462812051 has 12 divisors (see below), whose sum is σ = 2992076549280. Its totient is φ = 2203533979920.
The previous prime is 2571462812047. The next prime is 2571462812053. The reversal of 2571462812051 is 1502182641752.
It is a happy number.
It is not a de Polignac number, because 2571462812051 - 22 = 2571462812047 is a prime.
It is a super-2 number, since 2×25714628120512 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2571462811993 and 2571462812011.
It is not an unprimeable number, because it can be changed into a prime (2571462812053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6679931 + ... + 7054388.
It is an arithmetic number, because the mean of its divisors is an integer number (249339712440).
Almost surely, 22571462812051 is an apocalyptic number.
2571462812051 is a deficient number, since it is larger than the sum of its proper divisors (420613737229).
2571462812051 is a wasteful number, since it uses less digits than its factorization.
2571462812051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13738154 (or 13738147 counting only the distinct ones).
The product of its (nonzero) digits is 268800, while the sum is 44.
The spelling of 2571462812051 in words is "two trillion, five hundred seventy-one billion, four hundred sixty-two million, eight hundred twelve thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •