Base | Representation |
---|---|
bin | 1100000001000010100100… |
… | …1100011111000100101101 |
3 | 1201210001111201201221010222 |
4 | 3000100221030133010231 |
5 | 3212431144144310412 |
6 | 44033302554141125 |
7 | 2532351636435065 |
oct | 300205114370455 |
9 | 51701451657128 |
10 | 13212010541357 |
11 | 4234200572431 |
12 | 15946ab7217a5 |
13 | 74ab6c3901a4 |
14 | 3396712aa3a5 |
15 | 17da1c260072 |
hex | c042931f12d |
13212010541357 has 2 divisors, whose sum is σ = 13212010541358. Its totient is φ = 13212010541356.
The previous prime is 13212010541351. The next prime is 13212010541381. The reversal of 13212010541357 is 75314501021231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12816034842601 + 395975698756 = 3579949^2 + 629266^2 .
It is an emirp because it is prime and its reverse (75314501021231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13212010541357 - 26 = 13212010541293 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13212010541351) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6606005270678 + 6606005270679.
It is an arithmetic number, because the mean of its divisors is an integer number (6606005270679).
Almost surely, 213212010541357 is an apocalyptic number.
It is an amenable number.
13212010541357 is a deficient number, since it is larger than the sum of its proper divisors (1).
13212010541357 is an equidigital number, since it uses as much as digits as its factorization.
13212010541357 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 25200, while the sum is 35.
Adding to 13212010541357 its reverse (75314501021231), we get a palindrome (88526511562588).
The spelling of 13212010541357 in words is "thirteen trillion, two hundred twelve billion, ten million, five hundred forty-one thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •