Base | Representation |
---|---|
bin | 100100100010101101111110… |
… | …1001011011110000000111101 |
3 | 1120011002111121202110020020121 |
4 | 1021011123331023132000331 |
5 | 314112311202043441341 |
6 | 3055343211220014541 |
7 | 124463424035144062 |
oct | 11105337513360075 |
9 | 1504074552406217 |
10 | 321431010140221 |
11 | 93466142598103 |
12 | 30073596b31451 |
13 | 10a47a77a352c7 |
14 | 59534b5934c69 |
15 | 2726258eb44d1 |
hex | 12456fd2de03d |
321431010140221 has 2 divisors, whose sum is σ = 321431010140222. Its totient is φ = 321431010140220.
The previous prime is 321431010140111. The next prime is 321431010140269. The reversal of 321431010140221 is 122041010134123.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 254634944571225 + 66796065568996 = 15957285^2 + 8172886^2 .
It is a cyclic number.
It is not a de Polignac number, because 321431010140221 - 241 = 319231986884669 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (321435010140221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160715505070110 + 160715505070111.
It is an arithmetic number, because the mean of its divisors is an integer number (160715505070111).
Almost surely, 2321431010140221 is an apocalyptic number.
It is an amenable number.
321431010140221 is a deficient number, since it is larger than the sum of its proper divisors (1).
321431010140221 is an equidigital number, since it uses as much as digits as its factorization.
321431010140221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 321431010140221 its reverse (122041010134123), we get a palindrome (443472020274344).
The spelling of 321431010140221 in words is "three hundred twenty-one trillion, four hundred thirty-one billion, ten million, one hundred forty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •