Base | Representation |
---|---|
bin | 1100111111011111000… |
… | …0011011100010011101 |
3 | 210100010012011210201111 |
4 | 3033313300123202131 |
5 | 12124103200001112 |
6 | 250311530342021 |
7 | 22061050461301 |
oct | 3176760334235 |
9 | 710105153644 |
10 | 223200000157 |
11 | 86727643752 |
12 | 3731128a911 |
13 | 18080965714 |
14 | ab35391d01 |
15 | 5c150dd5a7 |
hex | 33f7c1b89d |
223200000157 has 2 divisors, whose sum is σ = 223200000158. Its totient is φ = 223200000156.
The previous prime is 223200000139. The next prime is 223200000161. The reversal of 223200000157 is 751000002322.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 155883622041 + 67316378116 = 394821^2 + 259454^2 .
It is a cyclic number.
It is not a de Polignac number, because 223200000157 - 219 = 223199475869 is a prime.
It is a super-3 number, since 3×2232000001573 (a number of 35 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (223200000137) 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, 111600000078 + 111600000079.
It is an arithmetic number, because the mean of its divisors is an integer number (111600000079).
Almost surely, 2223200000157 is an apocalyptic number.
It is an amenable number.
223200000157 is a deficient number, since it is larger than the sum of its proper divisors (1).
223200000157 is an equidigital number, since it uses as much as digits as its factorization.
223200000157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 840, while the sum is 22.
Adding to 223200000157 its reverse (751000002322), we get a palindrome (974200002479).
The spelling of 223200000157 in words is "two hundred twenty-three billion, two hundred million, one hundred fifty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •