Base | Representation |
---|---|
bin | 100100100000100001111101… |
… | …0001000100010110110001101 |
3 | 1120010000202110112121000202101 |
4 | 1021001003322020202312031 |
5 | 314042344334200044323 |
6 | 3054553121200555101 |
7 | 124432620323350366 |
oct | 11101037210426615 |
9 | 1503022415530671 |
10 | 321130311331213 |
11 | 9335a6669952aa |
12 | 30025257622a91 |
13 | 10a255c61c3457 |
14 | 5942b0ba88b6d |
15 | 271d50a2badad |
hex | 12410fa222d8d |
321130311331213 has 2 divisors, whose sum is σ = 321130311331214. Its totient is φ = 321130311331212.
The previous prime is 321130311331177. The next prime is 321130311331223. The reversal of 321130311331213 is 312133113031123.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 321115038820489 + 15272510724 = 17919683^2 + 123582^2 .
It is a cyclic number.
It is not a de Polignac number, because 321130311331213 - 229 = 321129774460301 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (321130311331223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160565155665606 + 160565155665607.
It is an arithmetic number, because the mean of its divisors is an integer number (160565155665607).
Almost surely, 2321130311331213 is an apocalyptic number.
It is an amenable number.
321130311331213 is a deficient number, since it is larger than the sum of its proper divisors (1).
321130311331213 is an equidigital number, since it uses as much as digits as its factorization.
321130311331213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2916, while the sum is 28.
Adding to 321130311331213 its reverse (312133113031123), we get a palindrome (633263424362336).
The spelling of 321130311331213 in words is "three hundred twenty-one trillion, one hundred thirty billion, three hundred eleven million, three hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •