Base | Representation |
---|---|
bin | 100100001010010… |
… | …0100101110011001 |
3 | 10010120010201012201 |
4 | 1020110210232121 |
5 | 4441104242412 |
6 | 320222210201 |
7 | 42032220613 |
oct | 11024445631 |
9 | 3116121181 |
10 | 1213352857 |
11 | 5729a6a62 |
12 | 29a423961 |
13 | 1644bb192 |
14 | b7207db3 |
15 | 717c6e57 |
hex | 48524b99 |
1213352857 has 2 divisors, whose sum is σ = 1213352858. Its totient is φ = 1213352856.
The previous prime is 1213352843. The next prime is 1213352947. The reversal of 1213352857 is 7582533121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1209926656 + 3426201 = 34784^2 + 1851^2 .
It is an emirp because it is prime and its reverse (7582533121) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1213352857 is a prime.
It is not a weakly prime, because it can be changed into another prime (1213352957) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 606676428 + 606676429.
It is an arithmetic number, because the mean of its divisors is an integer number (606676429).
Almost surely, 21213352857 is an apocalyptic number.
It is an amenable number.
1213352857 is a deficient number, since it is larger than the sum of its proper divisors (1).
1213352857 is an equidigital number, since it uses as much as digits as its factorization.
1213352857 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 50400, while the sum is 37.
The square root of 1213352857 is about 34833.2148530680. The cubic root of 1213352857 is about 1066.5855747706.
Adding to 1213352857 its reverse (7582533121), we get a palindrome (8795885978).
The spelling of 1213352857 in words is "one billion, two hundred thirteen million, three hundred fifty-two thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •