Base | Representation |
---|---|
bin | 100011100110000111111101… |
… | …0111000110100101111000011 |
3 | 1112001121100122111210001110222 |
4 | 1013030033322320310233003 |
5 | 312014340001202024141 |
6 | 3025525314001413255 |
7 | 122643642652653356 |
oct | 10714177270645703 |
9 | 1461540574701428 |
10 | 313103030111171 |
11 | 90845281a11723 |
12 | 2b14956b33a22b |
13 | 10592648597951 |
14 | 57463a60c229d |
15 | 262e7dd27114b |
hex | 11cc3fae34bc3 |
313103030111171 has 2 divisors, whose sum is σ = 313103030111172. Its totient is φ = 313103030111170.
The previous prime is 313103030111149. The next prime is 313103030111231. The reversal of 313103030111171 is 171111030301313.
It is a weak prime.
It is an emirp because it is prime and its reverse (171111030301313) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 313103030111171 - 226 = 313102963002307 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 313103030111171.
It is not a weakly prime, because it can be changed into another prime (313103030311171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156551515055585 + 156551515055586.
It is an arithmetic number, because the mean of its divisors is an integer number (156551515055586).
Almost surely, 2313103030111171 is an apocalyptic number.
313103030111171 is a deficient number, since it is larger than the sum of its proper divisors (1).
313103030111171 is an equidigital number, since it uses as much as digits as its factorization.
313103030111171 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 567, while the sum is 26.
Adding to 313103030111171 its reverse (171111030301313), we get a palindrome (484214060412484).
The spelling of 313103030111171 in words is "three hundred thirteen trillion, one hundred three billion, thirty million, one hundred eleven thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •