Base | Representation |
---|---|
bin | 1100010011110101000101… |
… | …1111110011001010100101 |
3 | 1202220220201010102212020121 |
4 | 3010331101133303022211 |
5 | 3233223242131141404 |
6 | 44441445554401541 |
7 | 2564600122213324 |
oct | 304752137631245 |
9 | 52826633385217 |
10 | 13534809240229 |
11 | 4349097a67622 |
12 | 16271782902b1 |
13 | 772433659654 |
14 | 34b13429a0bb |
15 | 187111218e54 |
hex | c4f517f32a5 |
13534809240229 has 2 divisors, whose sum is σ = 13534809240230. Its totient is φ = 13534809240228.
The previous prime is 13534809240109. The next prime is 13534809240257. The reversal of 13534809240229 is 92204290843531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10470874072129 + 3063935168100 = 3235873^2 + 1750410^2 .
It is an emirp because it is prime and its reverse (92204290843531) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13534809240229 is a prime.
It is a super-2 number, since 2×135348092402292 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13534809249229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6767404620114 + 6767404620115.
It is an arithmetic number, because the mean of its divisors is an integer number (6767404620115).
Almost surely, 213534809240229 is an apocalyptic number.
It is an amenable number.
13534809240229 is a deficient number, since it is larger than the sum of its proper divisors (1).
13534809240229 is an equidigital number, since it uses as much as digits as its factorization.
13534809240229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3732480, while the sum is 52.
The spelling of 13534809240229 in words is "thirteen trillion, five hundred thirty-four billion, eight hundred nine million, two hundred forty thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •