Base | Representation |
---|---|
bin | 1011011110010011100110… |
… | …0001100110000110100001 |
3 | 1122200000020211120200012122 |
4 | 2313210321201212012201 |
5 | 3123142100204301411 |
6 | 42455214222434025 |
7 | 2441265333133661 |
oct | 267447141460641 |
9 | 48600224520178 |
10 | 12615284056481 |
11 | 4024125a74237 |
12 | 14b8b15132915 |
13 | 7068019a0ca2 |
14 | 318823aaa1a1 |
15 | 16d2449b29db |
hex | b79398661a1 |
12615284056481 has 2 divisors, whose sum is σ = 12615284056482. Its totient is φ = 12615284056480.
The previous prime is 12615284056477. The next prime is 12615284056483. The reversal of 12615284056481 is 18465048251621.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9627367840000 + 2987916216481 = 3102800^2 + 1728559^2 .
It is a cyclic number.
It is not a de Polignac number, because 12615284056481 - 22 = 12615284056477 is a prime.
It is a super-2 number, since 2×126152840564812 (a number of 27 digits) contains 22 as substring.
Together with 12615284056483, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (12615284056483) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6307642028240 + 6307642028241.
It is an arithmetic number, because the mean of its divisors is an integer number (6307642028241).
Almost surely, 212615284056481 is an apocalyptic number.
It is an amenable number.
12615284056481 is a deficient number, since it is larger than the sum of its proper divisors (1).
12615284056481 is an equidigital number, since it uses as much as digits as its factorization.
12615284056481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3686400, while the sum is 53.
The spelling of 12615284056481 in words is "twelve trillion, six hundred fifteen billion, two hundred eighty-four million, fifty-six thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •