Base | Representation |
---|---|
bin | 11101011111011101001… |
… | …01011101100011001101 |
3 | 10120212120000120020111212 |
4 | 32233232211131203031 |
5 | 113100234422043313 |
6 | 2053302434424205 |
7 | 133132005560534 |
oct | 16575645354315 |
9 | 3525500506455 |
10 | 1013320112333 |
11 | 3608238714a1 |
12 | 14447aa32065 |
13 | 7472ba8a909 |
14 | 3708b4dd31b |
15 | 1b55ad4b3a8 |
hex | ebee95d8cd |
1013320112333 has 2 divisors, whose sum is σ = 1013320112334. Its totient is φ = 1013320112332.
The previous prime is 1013320112303. The next prime is 1013320112341. The reversal of 1013320112333 is 3332110233101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1000954227529 + 12365884804 = 1000477^2 + 111202^2 .
It is a cyclic number.
It is not a de Polignac number, because 1013320112333 - 224 = 1013303335117 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1013320112299 and 1013320112308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1013320112303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506660056166 + 506660056167.
It is an arithmetic number, because the mean of its divisors is an integer number (506660056167).
Almost surely, 21013320112333 is an apocalyptic number.
It is an amenable number.
1013320112333 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013320112333 is an equidigital number, since it uses as much as digits as its factorization.
1013320112333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 1013320112333 its reverse (3332110233101), we get a palindrome (4345430345434).
The spelling of 1013320112333 in words is "one trillion, thirteen billion, three hundred twenty million, one hundred twelve thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •