Base | Representation |
---|---|
bin | 1100110011101100000… |
… | …0001011001100110001 |
3 | 210000221111100101211102 |
4 | 3030323000023030301 |
5 | 12101112001434323 |
6 | 245025403454145 |
7 | 21616425425126 |
oct | 3147300131461 |
9 | 700844311742 |
10 | 220033233713 |
11 | 8535202a1a7 |
12 | 36788827355 |
13 | 17997861917 |
14 | a91497874d |
15 | 5acc0a7328 |
hex | 333b00b331 |
220033233713 has 2 divisors, whose sum is σ = 220033233714. Its totient is φ = 220033233712.
The previous prime is 220033233697. The next prime is 220033233731. The reversal of 220033233713 is 317332330022.
Together with next prime (220033233731) 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., 182014863424 + 38018370289 = 426632^2 + 194983^2 .
It is a cyclic number.
It is not a de Polignac number, because 220033233713 - 24 = 220033233697 is a prime.
It is not a weakly prime, because it can be changed into another prime (220033233733) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110016616856 + 110016616857.
It is an arithmetic number, because the mean of its divisors is an integer number (110016616857).
Almost surely, 2220033233713 is an apocalyptic number.
It is an amenable number.
220033233713 is a deficient number, since it is larger than the sum of its proper divisors (1).
220033233713 is an equidigital number, since it uses as much as digits as its factorization.
220033233713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13608, while the sum is 29.
Adding to 220033233713 its reverse (317332330022), we get a palindrome (537365563735).
The spelling of 220033233713 in words is "two hundred twenty billion, thirty-three million, two hundred thirty-three thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •