Base | Representation |
---|---|
bin | 1001010011000011101100… |
… | …0100111011101100110101 |
3 | 1100012022101101010101101001 |
4 | 2110300323010323230311 |
5 | 2314443212402011313 |
6 | 33424215410203301 |
7 | 2103405541260262 |
oct | 224607304735465 |
9 | 40168341111331 |
10 | 10223013313333 |
11 | 3291612558137 |
12 | 1191356583531 |
13 | 592045218562 |
14 | 274b217a6269 |
15 | 12adcd956add |
hex | 94c3b13bb35 |
10223013313333 has 2 divisors, whose sum is σ = 10223013313334. Its totient is φ = 10223013313332.
The previous prime is 10223013313319. The next prime is 10223013313349. The reversal of 10223013313333 is 33331331032201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10203820812964 + 19192500369 = 3194342^2 + 138537^2 .
It is a cyclic number.
It is not a de Polignac number, because 10223013313333 - 233 = 10214423378741 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10223013313363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5111506656666 + 5111506656667.
It is an arithmetic number, because the mean of its divisors is an integer number (5111506656667).
Almost surely, 210223013313333 is an apocalyptic number.
It is an amenable number.
10223013313333 is a deficient number, since it is larger than the sum of its proper divisors (1).
10223013313333 is an equidigital number, since it uses as much as digits as its factorization.
10223013313333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8748, while the sum is 28.
Adding to 10223013313333 its reverse (33331331032201), we get a palindrome (43554344345534).
The spelling of 10223013313333 in words is "ten trillion, two hundred twenty-three billion, thirteen million, three hundred thirteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •