Base | Representation |
---|---|
bin | 1001001001000011110… |
… | …01000010011111000001 |
3 | 1010000202020211212121202 |
4 | 10210201321002133001 |
5 | 20121234402304441 |
6 | 400143543030545 |
7 | 31456502155013 |
oct | 4444171023701 |
9 | 1100666755552 |
10 | 314101213121 |
11 | 111233a45443 |
12 | 50a5ba3b455 |
13 | 238093b74b7 |
14 | 112b9c441b3 |
15 | 828563619b |
hex | 4921e427c1 |
314101213121 has 2 divisors, whose sum is σ = 314101213122. Its totient is φ = 314101213120.
The previous prime is 314101213103. The next prime is 314101213147. The reversal of 314101213121 is 121312101413.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 174524253121 + 139576960000 = 417761^2 + 373600^2 .
It is an emirp because it is prime and its reverse (121312101413) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 314101213121 - 230 = 313027471297 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 314101213093 and 314101213102.
It is not a weakly prime, because it can be changed into another prime (314101213171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 157050606560 + 157050606561.
It is an arithmetic number, because the mean of its divisors is an integer number (157050606561).
Almost surely, 2314101213121 is an apocalyptic number.
It is an amenable number.
314101213121 is a deficient number, since it is larger than the sum of its proper divisors (1).
314101213121 is an equidigital number, since it uses as much as digits as its factorization.
314101213121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 314101213121 its reverse (121312101413), we get a palindrome (435413314534).
The spelling of 314101213121 in words is "three hundred fourteen billion, one hundred one million, two hundred thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •