Base | Representation |
---|---|
bin | 101111000010000100… |
… | …1000011010101110101 |
3 | 100122200221121020200211 |
4 | 1132010021003111311 |
5 | 3123322302311201 |
6 | 114222130305421 |
7 | 10203622101502 |
oct | 1360411032565 |
9 | 318627536624 |
10 | 101001213301 |
11 | 3991a60850a |
12 | 176a9128271 |
13 | 96a8082c51 |
14 | 4c620064a9 |
15 | 29620aa651 |
hex | 1784243575 |
101001213301 has 2 divisors, whose sum is σ = 101001213302. Its totient is φ = 101001213300.
The previous prime is 101001213283. The next prime is 101001213319. The reversal of 101001213301 is 103312100101.
It is a balanced prime because it is at equal distance from previous prime (101001213283) and next prime (101001213319).
It can be written as a sum of positive squares in only one way, i.e., 76272078276 + 24729135025 = 276174^2 + 157255^2 .
It is a cyclic number.
It is not a de Polignac number, because 101001213301 - 217 = 101001082229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101001213701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500606650 + 50500606651.
It is an arithmetic number, because the mean of its divisors is an integer number (50500606651).
Almost surely, 2101001213301 is an apocalyptic number.
It is an amenable number.
101001213301 is a deficient number, since it is larger than the sum of its proper divisors (1).
101001213301 is an equidigital number, since it uses as much as digits as its factorization.
101001213301 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.
Adding to 101001213301 its reverse (103312100101), we get a palindrome (204313313402).
The spelling of 101001213301 in words is "one hundred one billion, one million, two hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •