Base | Representation |
---|---|
bin | 1011001110110101101101… |
… | …1100110111110110111001 |
3 | 1121201121101102210210202011 |
4 | 2303231123130313312321 |
5 | 3104313402202141411 |
6 | 42133151215005521 |
7 | 2413140511544464 |
oct | 263553334676671 |
9 | 47647342723664 |
10 | 12349565271481 |
11 | 3a3146a709189 |
12 | 14755185098a1 |
13 | 6b77361aa5a9 |
14 | 309a1780a2db |
15 | 166391c00c21 |
hex | b3b5b737db9 |
12349565271481 has 2 divisors, whose sum is σ = 12349565271482. Its totient is φ = 12349565271480.
The previous prime is 12349565271389. The next prime is 12349565271493. The reversal of 12349565271481 is 18417256594321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7791271951225 + 4558293320256 = 2791285^2 + 2135016^2 .
It is a cyclic number.
It is not a de Polignac number, because 12349565271481 - 27 = 12349565271353 is a prime.
It is a super-2 number, since 2×123495652714812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12349560271481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6174782635740 + 6174782635741.
It is an arithmetic number, because the mean of its divisors is an integer number (6174782635741).
Almost surely, 212349565271481 is an apocalyptic number.
It is an amenable number.
12349565271481 is a deficient number, since it is larger than the sum of its proper divisors (1).
12349565271481 is an equidigital number, since it uses as much as digits as its factorization.
12349565271481 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14515200, while the sum is 58.
The spelling of 12349565271481 in words is "twelve trillion, three hundred forty-nine billion, five hundred sixty-five million, two hundred seventy-one thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •