Base | Representation |
---|---|
bin | 111100001011010000001… |
… | …100000001101010010101 |
3 | 112122022210202222021112101 |
4 | 330023100030001222111 |
5 | 1020222443321232323 |
6 | 12443412551522101 |
7 | 604522245351202 |
oct | 74132014015225 |
9 | 15568722867471 |
10 | 4135251352213 |
11 | 1354828645403 |
12 | 569533389331 |
13 | 23cc4c925b67 |
14 | 10420c018ca9 |
15 | 72879d74dad |
hex | 3c2d0301a95 |
4135251352213 has 2 divisors, whose sum is σ = 4135251352214. Its totient is φ = 4135251352212.
The previous prime is 4135251352139. The next prime is 4135251352217. The reversal of 4135251352213 is 3122531525314.
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., 3447401731524 + 687849620689 = 1856718^2 + 829367^2 .
It is a cyclic number.
It is not a de Polignac number, because 4135251352213 - 229 = 4134714481301 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4135251352217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2067625676106 + 2067625676107.
It is an arithmetic number, because the mean of its divisors is an integer number (2067625676107).
Almost surely, 24135251352213 is an apocalyptic number.
It is an amenable number.
4135251352213 is a deficient number, since it is larger than the sum of its proper divisors (1).
4135251352213 is an equidigital number, since it uses as much as digits as its factorization.
4135251352213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 108000, while the sum is 37.
Adding to 4135251352213 its reverse (3122531525314), we get a palindrome (7257782877527).
The spelling of 4135251352213 in words is "four trillion, one hundred thirty-five billion, two hundred fifty-one million, three hundred fifty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •