Base | Representation |
---|---|
bin | 1011111011011011000011… |
… | …1010001111101110000001 |
3 | 1201102211101222011201021121 |
4 | 2332312300322033232001 |
5 | 3204341022310312231 |
6 | 43521102355152241 |
7 | 2522364252616036 |
oct | 276666072175601 |
9 | 51384358151247 |
10 | 13115503213441 |
11 | 41a7287709592 |
12 | 1579a575a5681 |
13 | 741a2c352825 |
14 | 334b1805b38d |
15 | 17b26e986311 |
hex | bedb0e8fb81 |
13115503213441 has 2 divisors, whose sum is σ = 13115503213442. Its totient is φ = 13115503213440.
The previous prime is 13115503213411. The next prime is 13115503213457. The reversal of 13115503213441 is 14431230551131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12418117884225 + 697385329216 = 3523935^2 + 835096^2 .
It is a cyclic number.
It is not a de Polignac number, because 13115503213441 - 229 = 13114966342529 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13115503213397 and 13115503213406.
It is not a weakly prime, because it can be changed into another prime (13115503213411) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6557751606720 + 6557751606721.
It is an arithmetic number, because the mean of its divisors is an integer number (6557751606721).
Almost surely, 213115503213441 is an apocalyptic number.
It is an amenable number.
13115503213441 is a deficient number, since it is larger than the sum of its proper divisors (1).
13115503213441 is an equidigital number, since it uses as much as digits as its factorization.
13115503213441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21600, while the sum is 34.
Adding to 13115503213441 its reverse (14431230551131), we get a palindrome (27546733764572).
The spelling of 13115503213441 in words is "thirteen trillion, one hundred fifteen billion, five hundred three million, two hundred thirteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •