Base | Representation |
---|---|
bin | 1011001100110110011111… |
… | …0010110100110100100001 |
3 | 1121121100020021120001211011 |
4 | 2303031213302310310201 |
5 | 3103233431112130213 |
6 | 42105342241020521 |
7 | 2410521256004665 |
oct | 263154762646441 |
9 | 47540207501734 |
10 | 12315412614433 |
11 | 3a18a343a4485 |
12 | 146a986924741 |
13 | 6b44526a4696 |
14 | 3080d7a708a5 |
15 | 16554374a03d |
hex | b3367cb4d21 |
12315412614433 has 2 divisors, whose sum is σ = 12315412614434. Its totient is φ = 12315412614432.
The previous prime is 12315412614359. The next prime is 12315412614437. The reversal of 12315412614433 is 33441621451321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11509409072704 + 806003541729 = 3392552^2 + 897777^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12315412614433 is a prime.
It is a super-2 number, since 2×123154126144332 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12315412614437) 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, 6157706307216 + 6157706307217.
It is an arithmetic number, because the mean of its divisors is an integer number (6157706307217).
Almost surely, 212315412614433 is an apocalyptic number.
It is an amenable number.
12315412614433 is a deficient number, since it is larger than the sum of its proper divisors (1).
12315412614433 is an equidigital number, since it uses as much as digits as its factorization.
12315412614433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 207360, while the sum is 40.
The spelling of 12315412614433 in words is "twelve trillion, three hundred fifteen billion, four hundred twelve million, six hundred fourteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •