Base | Representation |
---|---|
bin | 10110100101011011001… |
… | …100111110001111111101 |
3 | 12111101000110212121211202 |
4 | 112211123030332033331 |
5 | 200412010402234323 |
6 | 3144552435425245 |
7 | 220062223364315 |
oct | 26453314761775 |
9 | 5441013777752 |
10 | 1552013321213 |
11 | 549229071473 |
12 | 21095a155225 |
13 | b347b315b54 |
14 | 55191522445 |
15 | 2a588883d28 |
hex | 1695b33e3fd |
1552013321213 has 2 divisors, whose sum is σ = 1552013321214. Its totient is φ = 1552013321212.
The previous prime is 1552013321189. The next prime is 1552013321231. The reversal of 1552013321213 is 3121233102551.
Together with next prime (1552013321231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1448549452249 + 103463868964 = 1203557^2 + 321658^2 .
It is a cyclic number.
It is not a de Polignac number, because 1552013321213 - 220 = 1552012272637 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1552013321813) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 776006660606 + 776006660607.
It is an arithmetic number, because the mean of its divisors is an integer number (776006660607).
Almost surely, 21552013321213 is an apocalyptic number.
It is an amenable number.
1552013321213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1552013321213 is an equidigital number, since it uses as much as digits as its factorization.
1552013321213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5400, while the sum is 29.
Adding to 1552013321213 its reverse (3121233102551), we get a palindrome (4673246423764).
The spelling of 1552013321213 in words is "one trillion, five hundred fifty-two billion, thirteen million, three hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •