Base | Representation |
---|---|
bin | 1011011010110000001110… |
… | …1001000011011111110001 |
3 | 1122110011201022011202121202 |
4 | 2312230003221003133301 |
5 | 3121142101112000311 |
6 | 42411202033500545 |
7 | 2434005013355213 |
oct | 266540351033761 |
9 | 48404638152552 |
10 | 12554250500081 |
11 | 4000256133a34 |
12 | 14a9121111755 |
13 | 700b26087c84 |
14 | 3158b3c525b3 |
15 | 16b871650e3b |
hex | b6b03a437f1 |
12554250500081 has 2 divisors, whose sum is σ = 12554250500082. Its totient is φ = 12554250500080.
The previous prime is 12554250500063. The next prime is 12554250500107. The reversal of 12554250500081 is 18000505245521.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10748562250000 + 1805688250081 = 3278500^2 + 1343759^2 .
It is a cyclic number.
It is not a de Polignac number, because 12554250500081 - 210 = 12554250499057 is a prime.
It is a super-2 number, since 2×125542505000812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12554250500021) 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 as a sum of consecutive naturals, namely, 6277125250040 + 6277125250041.
It is an arithmetic number, because the mean of its divisors is an integer number (6277125250041).
Almost surely, 212554250500081 is an apocalyptic number.
It is an amenable number.
12554250500081 is a deficient number, since it is larger than the sum of its proper divisors (1).
12554250500081 is an equidigital number, since it uses as much as digits as its factorization.
12554250500081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 80000, while the sum is 38.
The spelling of 12554250500081 in words is "twelve trillion, five hundred fifty-four billion, two hundred fifty million, five hundred thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •