Base | Representation |
---|---|
bin | 100111001000100… |
… | …0101010011011101 |
3 | 10101111211102222011 |
4 | 1032101011103131 |
5 | 10142123213041 |
6 | 334144151221 |
7 | 44353113601 |
oct | 11621052335 |
9 | 3344742864 |
10 | 1313101021 |
11 | 614236261 |
12 | 307908511 |
13 | 17c07416b |
14 | c6571501 |
15 | 7a42be81 |
hex | 4e4454dd |
1313101021 has 2 divisors, whose sum is σ = 1313101022. Its totient is φ = 1313101020.
The previous prime is 1313100977. The next prime is 1313101037. The reversal of 1313101021 is 1201013131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1295208121 + 17892900 = 35989^2 + 4230^2 .
It is an emirp because it is prime and its reverse (1201013131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1313101021 - 217 = 1312969949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1313100992 and 1313101010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1313171021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656550510 + 656550511.
It is an arithmetic number, because the mean of its divisors is an integer number (656550511).
Almost surely, 21313101021 is an apocalyptic number.
It is an amenable number.
1313101021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1313101021 is an equidigital number, since it uses as much as digits as its factorization.
1313101021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 1313101021 is about 36236.7357939426. The cubic root of 1313101021 is about 1095.0468821972.
Adding to 1313101021 its reverse (1201013131), we get a palindrome (2514114152).
The spelling of 1313101021 in words is "one billion, three hundred thirteen million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •