Base | Representation |
---|---|
bin | 1010100110110001001110… |
… | …01100100001111010001001 |
3 | 10001120121000021112000111101 |
4 | 11103120213030201322021 |
5 | 11024103112440411241 |
6 | 121334044104301401 |
7 | 4624661036132113 |
oct | 523304714417211 |
9 | 101517007460441 |
10 | 23322330013321 |
11 | 7481a4330a579 |
12 | 2748035171861 |
13 | 1002394c70371 |
14 | 5a8b41bc03b3 |
15 | 2a6a02353e31 |
hex | 153627321e89 |
23322330013321 has 2 divisors, whose sum is σ = 23322330013322. Its totient is φ = 23322330013320.
The previous prime is 23322330013271. The next prime is 23322330013373. The reversal of 23322330013321 is 12331003322332.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22369012108921 + 953317904400 = 4729589^2 + 976380^2 .
It is a cyclic number.
It is not a de Polignac number, because 23322330013321 - 229 = 23321793142409 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 23322330013321.
It is not a weakly prime, because it can be changed into another prime (23322330013421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11661165006660 + 11661165006661.
It is an arithmetic number, because the mean of its divisors is an integer number (11661165006661).
Almost surely, 223322330013321 is an apocalyptic number.
It is an amenable number.
23322330013321 is a deficient number, since it is larger than the sum of its proper divisors (1).
23322330013321 is an equidigital number, since it uses as much as digits as its factorization.
23322330013321 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 28.
Adding to 23322330013321 its reverse (12331003322332), we get a palindrome (35653333335653).
The spelling of 23322330013321 in words is "twenty-three trillion, three hundred twenty-two billion, three hundred thirty million, thirteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •