Base | Representation |
---|---|
bin | 100011100110000111111111… |
… | …1101010000100110110011101 |
3 | 1112001121100212002100111012002 |
4 | 1013030033333222010312131 |
5 | 312014340132143143401 |
6 | 3025525325540452045 |
7 | 122643644644061543 |
oct | 10714177752046635 |
9 | 1461540762314162 |
10 | 313103110131101 |
11 | 908453130a68a4 |
12 | 2b1495920aa025 |
13 | 1059265c034114 |
14 | 57463b2991d93 |
15 | 262e7e52caa6b |
hex | 11cc3ffa84d9d |
313103110131101 has 2 divisors, whose sum is σ = 313103110131102. Its totient is φ = 313103110131100.
The previous prime is 313103110131047. The next prime is 313103110131137. The reversal of 313103110131101 is 101131011301313.
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., 178267492339225 + 134835617791876 = 13351685^2 + 11611874^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-313103110131101 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (313103110131191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156551555065550 + 156551555065551.
It is an arithmetic number, because the mean of its divisors is an integer number (156551555065551).
Almost surely, 2313103110131101 is an apocalyptic number.
It is an amenable number.
313103110131101 is a deficient number, since it is larger than the sum of its proper divisors (1).
313103110131101 is an equidigital number, since it uses as much as digits as its factorization.
313103110131101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 81, while the sum is 20.
Adding to 313103110131101 its reverse (101131011301313), we get a palindrome (414234121432414).
The spelling of 313103110131101 in words is "three hundred thirteen trillion, one hundred three billion, one hundred ten million, one hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •