Base | Representation |
---|---|
bin | 10011000101111111010… |
… | …100001011001001001001 |
3 | 11122102202120112222021201 |
4 | 103011333110023021021 |
5 | 132444140330121413 |
6 | 2442434302304201 |
7 | 163540041436633 |
oct | 23057724131111 |
9 | 4572676488251 |
10 | 1312101020233 |
11 | 466505901863 |
12 | 192363b88061 |
13 | 9696616bc43 |
14 | 47712781a53 |
15 | 241e649c9dd |
hex | 1317f50b249 |
1312101020233 has 2 divisors, whose sum is σ = 1312101020234. Its totient is φ = 1312101020232.
The previous prime is 1312101020231. The next prime is 1312101020257. The reversal of 1312101020233 is 3320201012131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1257959641744 + 54141378489 = 1121588^2 + 232683^2 .
It is a cyclic number.
It is not a de Polignac number, because 1312101020233 - 21 = 1312101020231 is a prime.
Together with 1312101020231, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1312101020233.
It is not a weakly prime, because it can be changed into another prime (1312101020231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656050510116 + 656050510117.
It is an arithmetic number, because the mean of its divisors is an integer number (656050510117).
Almost surely, 21312101020233 is an apocalyptic number.
It is an amenable number.
1312101020233 is a deficient number, since it is larger than the sum of its proper divisors (1).
1312101020233 is an equidigital number, since it uses as much as digits as its factorization.
1312101020233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1312101020233 its reverse (3320201012131), we get a palindrome (4632302032364).
The spelling of 1312101020233 in words is "one trillion, three hundred twelve billion, one hundred one million, twenty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •