Base | Representation |
---|---|
bin | 101111000101011010… |
… | …0101001110011001001 |
3 | 100122222202112011101212 |
4 | 1132022310221303021 |
5 | 3124040001300223 |
6 | 114241213022505 |
7 | 10206452631335 |
oct | 1361264516311 |
9 | 318882464355 |
10 | 101113306313 |
11 | 39977909668 |
12 | 1771a784a35 |
13 | 96c536bb86 |
14 | 4c72c647c5 |
15 | 296bd4d278 |
hex | 178ad29cc9 |
101113306313 has 2 divisors, whose sum is σ = 101113306314. Its totient is φ = 101113306312.
The previous prime is 101113306303. The next prime is 101113306319. The reversal of 101113306313 is 313603311101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 93261219769 + 7852086544 = 305387^2 + 88612^2 .
It is a cyclic number.
It is not a de Polignac number, because 101113306313 - 28 = 101113306057 is a prime.
It is not a weakly prime, because it can be changed into another prime (101113306319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50556653156 + 50556653157.
It is an arithmetic number, because the mean of its divisors is an integer number (50556653157).
Almost surely, 2101113306313 is an apocalyptic number.
It is an amenable number.
101113306313 is a deficient number, since it is larger than the sum of its proper divisors (1).
101113306313 is an equidigital number, since it uses as much as digits as its factorization.
101113306313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 101113306313 its reverse (313603311101), we get a palindrome (414716617414).
The spelling of 101113306313 in words is "one hundred one billion, one hundred thirteen million, three hundred six thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •