Base | Representation |
---|---|
bin | 1010111101011110111110… |
… | …1010010100110101110001 |
3 | 1120200002210001222201112011 |
4 | 2233113233222110311301 |
5 | 3034422233423142223 |
6 | 41344201050402521 |
7 | 2352454012540633 |
oct | 257275752246561 |
9 | 46602701881464 |
10 | 12051404115313 |
11 | 3926a76497532 |
12 | 1427786a30441 |
13 | 69559a31c274 |
14 | 2d94109b2a53 |
15 | 15d740bbe80d |
hex | af5efa94d71 |
12051404115313 has 2 divisors, whose sum is σ = 12051404115314. Its totient is φ = 12051404115312.
The previous prime is 12051404115307. The next prime is 12051404115319. The reversal of 12051404115313 is 31351140415021.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (12051404115307) and next prime (12051404115319).
It can be written as a sum of positive squares in only one way, i.e., 11825847510129 + 225556605184 = 3438873^2 + 474928^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12051404115313 is a prime.
It is a super-2 number, since 2×120514041153132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12051404115319) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6025702057656 + 6025702057657.
It is an arithmetic number, because the mean of its divisors is an integer number (6025702057657).
Almost surely, 212051404115313 is an apocalyptic number.
It is an amenable number.
12051404115313 is a deficient number, since it is larger than the sum of its proper divisors (1).
12051404115313 is an equidigital number, since it uses as much as digits as its factorization.
12051404115313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7200, while the sum is 31.
The spelling of 12051404115313 in words is "twelve trillion, fifty-one billion, four hundred four million, one hundred fifteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •