Base | Representation |
---|---|
bin | 11110000100100000011… |
… | …11110111110101100101 |
3 | 10122202220100002120102011 |
4 | 33002100033313311211 |
5 | 113412004312343023 |
6 | 2110352351514221 |
7 | 134434651025614 |
oct | 17022017676545 |
9 | 3582810076364 |
10 | 1033212231013 |
11 | 3692014066a6 |
12 | 1482b0828971 |
13 | 7657bcc2641 |
14 | 3801734187b |
15 | 1bd223a750d |
hex | f0903f7d65 |
1033212231013 has 2 divisors, whose sum is σ = 1033212231014. Its totient is φ = 1033212231012.
The previous prime is 1033212231011. The next prime is 1033212231031. The reversal of 1033212231013 is 3101322123301.
Together with next prime (1033212231031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 972793607809 + 60418623204 = 986303^2 + 245802^2 .
It is a cyclic number.
It is not a de Polignac number, because 1033212231013 - 21 = 1033212231011 is a prime.
Together with 1033212231011, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1033212231011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516606115506 + 516606115507.
It is an arithmetic number, because the mean of its divisors is an integer number (516606115507).
Almost surely, 21033212231013 is an apocalyptic number.
It is an amenable number.
1033212231013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1033212231013 is an equidigital number, since it uses as much as digits as its factorization.
1033212231013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1033212231013 its reverse (3101322123301), we get a palindrome (4134534354314).
The spelling of 1033212231013 in words is "one trillion, thirty-three billion, two hundred twelve million, two hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •