Base | Representation |
---|---|
bin | 1100111111111100000… |
… | …1101101100010110101 |
3 | 210100102200200120002021 |
4 | 3033333001231202311 |
5 | 12124330411031434 |
6 | 250332004513141 |
7 | 22064061301114 |
oct | 3177701554265 |
9 | 710380616067 |
10 | 223321970869 |
11 | 8678a481098 |
12 | 373460ab7b1 |
13 | 1809cccc63a |
14 | ab47661c7b |
15 | 5c20b82cb4 |
hex | 33ff06d8b5 |
223321970869 has 2 divisors, whose sum is σ = 223321970870. Its totient is φ = 223321970868.
The previous prime is 223321970867. The next prime is 223321970903. The reversal of 223321970869 is 968079123322.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 205127468100 + 18194502769 = 452910^2 + 134887^2 .
It is a cyclic number.
It is not a de Polignac number, because 223321970869 - 21 = 223321970867 is a prime.
It is a super-2 number, since 2×2233219708692 (a number of 23 digits) contains 22 as substring.
Together with 223321970867, 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 (223321970863) 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, 111660985434 + 111660985435.
It is an arithmetic number, because the mean of its divisors is an integer number (111660985435).
Almost surely, 2223321970869 is an apocalyptic number.
It is an amenable number.
223321970869 is a deficient number, since it is larger than the sum of its proper divisors (1).
223321970869 is an equidigital number, since it uses as much as digits as its factorization.
223321970869 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1959552, while the sum is 52.
The spelling of 223321970869 in words is "two hundred twenty-three billion, three hundred twenty-one million, nine hundred seventy thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •