Base | Representation |
---|---|
bin | 10010110100001010… |
… | …00001100010000111 |
3 | 222001222012011211201 |
4 | 21122011001202013 |
5 | 131141401413111 |
6 | 4350155443331 |
7 | 505213535455 |
oct | 113205014207 |
9 | 28058164751 |
10 | 10101201031 |
11 | 4313956929 |
12 | 1b5aa56547 |
13 | c4c96183c |
14 | 6bb7879d5 |
15 | 3e1bed6c1 |
hex | 25a141887 |
10101201031 has 2 divisors, whose sum is σ = 10101201032. Its totient is φ = 10101201030.
The previous prime is 10101201013. The next prime is 10101201067. The reversal of 10101201031 is 13010210101.
Together with previous prime (10101201013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10101201031 - 27 = 10101200903 is a prime.
It is a super-2 number, since 2×101012010312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10101200999 and 10101201017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10101201001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050600515 + 5050600516.
It is an arithmetic number, because the mean of its divisors is an integer number (5050600516).
Almost surely, 210101201031 is an apocalyptic number.
10101201031 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101201031 is an equidigital number, since it uses as much as digits as its factorization.
10101201031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 10101201031 its reverse (13010210101), we get a palindrome (23111411132).
The spelling of 10101201031 in words is "ten billion, one hundred one million, two hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •