Base | Representation |
---|---|
bin | 100100100010101000111101… |
… | …0110011111111101111000101 |
3 | 1120011001110210200101111122111 |
4 | 1021011101322303333233011 |
5 | 314112122114122423323 |
6 | 3055334225552501021 |
7 | 124462563003114454 |
oct | 11105217263775705 |
9 | 1504043720344574 |
10 | 321420233014213 |
11 | 934616121458a3 |
12 | 3007148984a771 |
13 | 10a46a4b043578 |
14 | 5952b724bcb9b |
15 | 2725d27c9bc0d |
hex | 124547acffbc5 |
321420233014213 has 2 divisors, whose sum is σ = 321420233014214. Its totient is φ = 321420233014212.
The previous prime is 321420233014187. The next prime is 321420233014327. The reversal of 321420233014213 is 312410332024123.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 295948094672164 + 25472138342049 = 17203142^2 + 5046993^2 .
It is a cyclic number.
It is not a de Polignac number, because 321420233014213 - 245 = 286235860925381 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (321420233014513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160710116507106 + 160710116507107.
It is an arithmetic number, because the mean of its divisors is an integer number (160710116507107).
Almost surely, 2321420233014213 is an apocalyptic number.
It is an amenable number.
321420233014213 is a deficient number, since it is larger than the sum of its proper divisors (1).
321420233014213 is an equidigital number, since it uses as much as digits as its factorization.
321420233014213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 321420233014213 its reverse (312410332024123), we get a palindrome (633830565038336).
The spelling of 321420233014213 in words is "three hundred twenty-one trillion, four hundred twenty billion, two hundred thirty-three million, fourteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •