Base | Representation |
---|---|
bin | 1011100101111100011111… |
… | …1101011101110110011111 |
3 | 1200010120000002022212210002 |
4 | 2321133013331131312133 |
5 | 3132314334310340041 |
6 | 43035401031204515 |
7 | 2453622500446556 |
oct | 271370775356637 |
9 | 50116002285702 |
10 | 12746522746271 |
11 | 4074851875336 |
12 | 151a44081673b |
13 | 715cb8395352 |
14 | 320d13896d9d |
15 | 17187645559b |
hex | b97c7f5dd9f |
12746522746271 has 12 divisors (see below), whose sum is σ = 13540746683040. Its totient is φ = 11996441233920.
The previous prime is 12746522746241. The next prime is 12746522746273. The reversal of 12746522746271 is 17264722564721.
It is not a de Polignac number, because 12746522746271 - 222 = 12746518551967 is a prime.
It is a hoax number, since the sum of its digits (56) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12746522746273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12142391 + ... + 13150311.
It is an arithmetic number, because the mean of its divisors is an integer number (1128395556920).
Almost surely, 212746522746271 is an apocalyptic number.
12746522746271 is a deficient number, since it is larger than the sum of its proper divisors (794223936769).
12746522746271 is a wasteful number, since it uses less digits than its factorization.
12746522746271 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1051714 (or 1051697 counting only the distinct ones).
The product of its digits is 15805440, while the sum is 56.
The spelling of 12746522746271 in words is "twelve trillion, seven hundred forty-six billion, five hundred twenty-two million, seven hundred forty-six thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •