Base | Representation |
---|---|
bin | 1100010011110111011100… |
… | …0110110000110111010101 |
3 | 1202220222100002201111222201 |
4 | 3010331313012300313111 |
5 | 3233231040143231123 |
6 | 44442032334324501 |
7 | 2564621553324421 |
oct | 304756706606725 |
9 | 52828302644881 |
10 | 13535440211413 |
11 | 434939114960a |
12 | 1627313659731 |
13 | 7725042aa293 |
14 | 34b193dc5b81 |
15 | 18714b8035ad |
hex | c4f771b0dd5 |
13535440211413 has 2 divisors, whose sum is σ = 13535440211414. Its totient is φ = 13535440211412.
The previous prime is 13535440211411. The next prime is 13535440211483. The reversal of 13535440211413 is 31411204453531.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13043524542724 + 491915668689 = 3611582^2 + 701367^2 .
It is a cyclic number.
It is not a de Polignac number, because 13535440211413 - 21 = 13535440211411 is a prime.
Together with 13535440211411, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13535440211411) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6767720105706 + 6767720105707.
It is an arithmetic number, because the mean of its divisors is an integer number (6767720105707).
Almost surely, 213535440211413 is an apocalyptic number.
It is an amenable number.
13535440211413 is a deficient number, since it is larger than the sum of its proper divisors (1).
13535440211413 is an equidigital number, since it uses as much as digits as its factorization.
13535440211413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 86400, while the sum is 37.
Adding to 13535440211413 its reverse (31411204453531), we get a palindrome (44946644664944).
The spelling of 13535440211413 in words is "thirteen trillion, five hundred thirty-five billion, four hundred forty million, two hundred eleven thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •