Base | Representation |
---|---|
bin | 1101100000010110011… |
… | …0001001001110100101 |
3 | 211011220000112220010011 |
4 | 3120011212021032211 |
5 | 12300140130304313 |
6 | 254331155130221 |
7 | 22522503321334 |
oct | 3300546111645 |
9 | 734800486104 |
10 | 232022119333 |
11 | 8a44448a434 |
12 | 38b738a3971 |
13 | 18b58604594 |
14 | b330d01d1b |
15 | 607e87e93d |
hex | 36059893a5 |
232022119333 has 2 divisors, whose sum is σ = 232022119334. Its totient is φ = 232022119332.
The previous prime is 232022119327. The next prime is 232022119349. The reversal of 232022119333 is 333911220232.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 223428273124 + 8593846209 = 472682^2 + 92703^2 .
It is a cyclic number.
It is not a de Polignac number, because 232022119333 - 237 = 94583165861 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 232022119295 and 232022119304.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232022119393) 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, 116011059666 + 116011059667.
It is an arithmetic number, because the mean of its divisors is an integer number (116011059667).
Almost surely, 2232022119333 is an apocalyptic number.
It is an amenable number.
232022119333 is a deficient number, since it is larger than the sum of its proper divisors (1).
232022119333 is an equidigital number, since it uses as much as digits as its factorization.
232022119333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 31.
Adding to 232022119333 its reverse (333911220232), we get a palindrome (565933339565).
The spelling of 232022119333 in words is "two hundred thirty-two billion, twenty-two million, one hundred nineteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •