Base | Representation |
---|---|
bin | 1001000111001100100… |
… | …01111111111101011101 |
3 | 1002221011120000001110111 |
4 | 10203212101333331131 |
5 | 20112212341422141 |
6 | 355500415410021 |
7 | 31422636431422 |
oct | 4434621777535 |
9 | 1087146001414 |
10 | 313101123421 |
11 | 110870470229 |
12 | 50820b23911 |
13 | 236aa148548 |
14 | 112230b1d49 |
15 | 8227938381 |
hex | 48e647ff5d |
313101123421 has 2 divisors, whose sum is σ = 313101123422. Its totient is φ = 313101123420.
The previous prime is 313101123289. The next prime is 313101123449. The reversal of 313101123421 is 124321101313.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 273733008025 + 39368115396 = 523195^2 + 198414^2 .
It is an emirp because it is prime and its reverse (124321101313) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 313101123421 - 211 = 313101121373 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 313101123392 and 313101123401.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (313101120421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156550561710 + 156550561711.
It is an arithmetic number, because the mean of its divisors is an integer number (156550561711).
Almost surely, 2313101123421 is an apocalyptic number.
It is an amenable number.
313101123421 is a deficient number, since it is larger than the sum of its proper divisors (1).
313101123421 is an equidigital number, since it uses as much as digits as its factorization.
313101123421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 313101123421 its reverse (124321101313), we get a palindrome (437422224734).
The spelling of 313101123421 in words is "three hundred thirteen billion, one hundred one million, one hundred twenty-three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •