Base | Representation |
---|---|
bin | 10111000010100100000010… |
… | …010011001100110110001001 |
3 | 111021210011112200201221002011 |
4 | 113002210002103030312021 |
5 | 101240202300203033223 |
6 | 555302524521335521 |
7 | 30225636435360463 |
oct | 2702440223146611 |
9 | 437704480657064 |
10 | 101331202002313 |
11 | 2a318359916538 |
12 | b4467ba6375a1 |
13 | 447065064b13a |
14 | 1b046562d7133 |
15 | baacccb0280d |
hex | 5c29024ccd89 |
101331202002313 has 2 divisors, whose sum is σ = 101331202002314. Its totient is φ = 101331202002312.
The previous prime is 101331202002269. The next prime is 101331202002337. The reversal of 101331202002313 is 313200202133101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 55492845219904 + 45838356782409 = 7449352^2 + 6770403^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101331202002313 is a prime.
It is not a weakly prime, because it can be changed into another prime (101331202002353) 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, 50665601001156 + 50665601001157.
It is an arithmetic number, because the mean of its divisors is an integer number (50665601001157).
Almost surely, 2101331202002313 is an apocalyptic number.
It is an amenable number.
101331202002313 is a deficient number, since it is larger than the sum of its proper divisors (1).
101331202002313 is an equidigital number, since it uses as much as digits as its factorization.
101331202002313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 101331202002313 its reverse (313200202133101), we get a palindrome (414531404135414).
The spelling of 101331202002313 in words is "one hundred one trillion, three hundred thirty-one billion, two hundred two million, two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •