Base | Representation |
---|---|
bin | 1010100110110000100111… |
… | …01101111011001010100001 |
3 | 10001120120011111121100201121 |
4 | 11103120103231323022201 |
5 | 11024101430311120301 |
6 | 121333551432132241 |
7 | 4624646660353204 |
oct | 523302355731241 |
9 | 101516144540647 |
10 | 23322003223201 |
11 | 74818958a82a1 |
12 | 2747b63837081 |
13 | 1002342352627 |
14 | 5a8b1063593b |
15 | 2a69d38023a1 |
hex | 153613b7b2a1 |
23322003223201 has 2 divisors, whose sum is σ = 23322003223202. Its totient is φ = 23322003223200.
The previous prime is 23322003223159. The next prime is 23322003223219. The reversal of 23322003223201 is 10232230022332.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20336627448225 + 2985375774976 = 4509615^2 + 1727824^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23322003223201 is a prime.
It is not a weakly prime, because it can be changed into another prime (23322003223501) 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, 11661001611600 + 11661001611601.
It is an arithmetic number, because the mean of its divisors is an integer number (11661001611601).
Almost surely, 223322003223201 is an apocalyptic number.
It is an amenable number.
23322003223201 is a deficient number, since it is larger than the sum of its proper divisors (1).
23322003223201 is an equidigital number, since it uses as much as digits as its factorization.
23322003223201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 25.
Adding to 23322003223201 its reverse (10232230022332), we get a palindrome (33554233245533).
The spelling of 23322003223201 in words is "twenty-three trillion, three hundred twenty-two billion, three million, two hundred twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •