Base | Representation |
---|---|
bin | 1011001100110111010001… |
… | …0010110001011000100001 |
3 | 1121121100202220010222200022 |
4 | 2303031310102301120201 |
5 | 3103234343303044203 |
6 | 42105415131403225 |
7 | 2410526413305344 |
oct | 263156422613041 |
9 | 47540686128608 |
10 | 12315622315553 |
11 | 3a19031802a97 |
12 | 146aa24bb3515 |
13 | 6b4486c7749b |
14 | 30811785a45b |
15 | 165556d6da38 |
hex | b33744b1621 |
12315622315553 has 6 divisors (see below), whose sum is σ = 12997928261394. Its totient is φ = 11667431667024.
The previous prime is 12315622315463. The next prime is 12315622315573. The reversal of 12315622315553 is 35551322651321.
It can be written as a sum of positive squares in only one way, i.e., 10554396055009 + 1761226260544 = 3248753^2 + 1327112^2 .
It is not a de Polignac number, because 12315622315553 - 230 = 12314548573729 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12315622315573) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 17057648276 + ... + 17057648997.
It is an arithmetic number, because the mean of its divisors is an integer number (2166321376899).
Almost surely, 212315622315553 is an apocalyptic number.
It is an amenable number.
12315622315553 is a deficient number, since it is larger than the sum of its proper divisors (682305945841).
12315622315553 is an equidigital number, since it uses as much as digits as its factorization.
12315622315553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34115297311 (or 34115297292 counting only the distinct ones).
The product of its digits is 810000, while the sum is 44.
Adding to 12315622315553 its reverse (35551322651321), we get a palindrome (47866944966874).
The spelling of 12315622315553 in words is "twelve trillion, three hundred fifteen billion, six hundred twenty-two million, three hundred fifteen thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •