Base | Representation |
---|---|
bin | 10011011001011110001… |
… | …100101000110110001101 |
3 | 11201102202110202002112111 |
4 | 103121132030220312031 |
5 | 133320011134424401 |
6 | 2500214145504021 |
7 | 165210325012504 |
oct | 23313614506615 |
9 | 4642673662474 |
10 | 1333020233101 |
11 | 474370196037 |
12 | 196421942011 |
13 | 9891b1092cb |
14 | 48738b8583b |
15 | 24a1cc8ce51 |
hex | 1365e328d8d |
1333020233101 has 2 divisors, whose sum is σ = 1333020233102. Its totient is φ = 1333020233100.
The previous prime is 1333020233099. The next prime is 1333020233197. The reversal of 1333020233101 is 1013320203331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1186082177476 + 146938055625 = 1089074^2 + 383325^2 .
It is an emirp because it is prime and its reverse (1013320203331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1333020233101 - 21 = 1333020233099 is a prime.
Together with 1333020233099, 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 (1333020233801) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 666510116550 + 666510116551.
It is an arithmetic number, because the mean of its divisors is an integer number (666510116551).
Almost surely, 21333020233101 is an apocalyptic number.
It is an amenable number.
1333020233101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1333020233101 is an equidigital number, since it uses as much as digits as its factorization.
1333020233101 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 22.
Adding to 1333020233101 its reverse (1013320203331), we get a palindrome (2346340436432).
The spelling of 1333020233101 in words is "one trillion, three hundred thirty-three billion, twenty million, two hundred thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •