Base | Representation |
---|---|
bin | 11110000100000111010… |
… | …10110110111000111101 |
3 | 10122202100122000010221122 |
4 | 33002003222312320331 |
5 | 113411041301414323 |
6 | 2110315412440325 |
7 | 134426506222442 |
oct | 17020352667075 |
9 | 3582318003848 |
10 | 1033001201213 |
11 | 36910327a903 |
12 | 1482520190a5 |
13 | 76547375b37 |
14 | 37dd72cb9c9 |
15 | 1bd0dabeec8 |
hex | f083ab6e3d |
1033001201213 has 2 divisors, whose sum is σ = 1033001201214. Its totient is φ = 1033001201212.
The previous prime is 1033001201201. The next prime is 1033001201237. The reversal of 1033001201213 is 3121021003301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 555163578649 + 477837622564 = 745093^2 + 691258^2 .
It is an emirp because it is prime and its reverse (3121021003301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1033001201213 - 226 = 1032934092349 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1033001201191 and 1033001201200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1033001201413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516500600606 + 516500600607.
It is an arithmetic number, because the mean of its divisors is an integer number (516500600607).
Almost surely, 21033001201213 is an apocalyptic number.
It is an amenable number.
1033001201213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1033001201213 is an equidigital number, since it uses as much as digits as its factorization.
1033001201213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1033001201213 its reverse (3121021003301), we get a palindrome (4154022204514).
The spelling of 1033001201213 in words is "one trillion, thirty-three billion, one million, two hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •