Base | Representation |
---|---|
bin | 1001101010100110101… |
… | …11110001100011011001 |
3 | 1011202020101212011121201 |
4 | 10311103113301203121 |
5 | 20420130433114001 |
6 | 412323024034201 |
7 | 32665011550315 |
oct | 4652327614331 |
9 | 1152211764551 |
10 | 332111223001 |
11 | 118936144428 |
12 | 54447462961 |
13 | 25419710c8c |
14 | 12107b18b45 |
15 | 898b81a501 |
hex | 4d535f18d9 |
332111223001 has 2 divisors, whose sum is σ = 332111223002. Its totient is φ = 332111223000.
The previous prime is 332111222983. The next prime is 332111223011. The reversal of 332111223001 is 100322111233.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 257896387225 + 74214835776 = 507835^2 + 272424^2 .
It is a cyclic number.
It is not a de Polignac number, because 332111223001 - 227 = 331977005273 is a prime.
It is a super-2 number, since 2×3321112230012 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 332111223001.
It is not a weakly prime, because it can be changed into another prime (332111223011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 166055611500 + 166055611501.
It is an arithmetic number, because the mean of its divisors is an integer number (166055611501).
Almost surely, 2332111223001 is an apocalyptic number.
It is an amenable number.
332111223001 is a deficient number, since it is larger than the sum of its proper divisors (1).
332111223001 is an equidigital number, since it uses as much as digits as its factorization.
332111223001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 332111223001 its reverse (100322111233), we get a palindrome (432433334234).
The spelling of 332111223001 in words is "three hundred thirty-two billion, one hundred eleven million, two hundred twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •