Base | Representation |
---|---|
bin | 1010011110000010001110… |
… | …10000001001000100000001 |
3 | 10000111220101002210211220011 |
4 | 11033001013100021010001 |
5 | 11004144001322322241 |
6 | 120544132323544521 |
7 | 4564205035131622 |
oct | 517010720110401 |
9 | 100456332724804 |
10 | 23022220120321 |
11 | 737673a085014 |
12 | 26b9a3ab2b141 |
13 | cacca8446016 |
14 | 5983d2233a49 |
15 | 29dcda1d9281 |
hex | 14f047409101 |
23022220120321 has 2 divisors, whose sum is σ = 23022220120322. Its totient is φ = 23022220120320.
The previous prime is 23022220120271. The next prime is 23022220120391. The reversal of 23022220120321 is 12302102222032.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14049415545025 + 8972804575296 = 3748255^2 + 2995464^2 .
It is a cyclic number.
It is not a de Polignac number, because 23022220120321 - 233 = 23013630185729 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 23022220120292 and 23022220120301.
It is not a weakly prime, because it can be changed into another prime (23022220120391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11511110060160 + 11511110060161.
It is an arithmetic number, because the mean of its divisors is an integer number (11511110060161).
Almost surely, 223022220120321 is an apocalyptic number.
It is an amenable number.
23022220120321 is a deficient number, since it is larger than the sum of its proper divisors (1).
23022220120321 is an equidigital number, since it uses as much as digits as its factorization.
23022220120321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 23022220120321 its reverse (12302102222032), we get a palindrome (35324322342353).
The spelling of 23022220120321 in words is "twenty-three trillion, twenty-two billion, two hundred twenty million, one hundred twenty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •