Base | Representation |
---|---|
bin | 101111000010011001… |
… | …0101000001011100101 |
3 | 100122201201002222001002 |
4 | 1132010302220023211 |
5 | 3123333100041401 |
6 | 114223200043045 |
7 | 10204113533435 |
oct | 1360462501345 |
9 | 318651088032 |
10 | 101012112101 |
11 | 3992578198a |
12 | 176b0903485 |
13 | 96aa3ca944 |
14 | 4c636422c5 |
15 | 296300ea6b |
hex | 1784ca82e5 |
101012112101 has 2 divisors, whose sum is σ = 101012112102. Its totient is φ = 101012112100.
The previous prime is 101012112077. The next prime is 101012112109. The reversal of 101012112101 is 101211210101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 73081012225 + 27931099876 = 270335^2 + 167126^2 .
It is a cyclic number.
It is not a de Polignac number, because 101012112101 - 222 = 101007917797 is a prime.
It is a super-2 number, since 2×1010121121012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101012112109) 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, 50506056050 + 50506056051.
It is an arithmetic number, because the mean of its divisors is an integer number (50506056051).
Almost surely, 2101012112101 is an apocalyptic number.
It is an amenable number.
101012112101 is a deficient number, since it is larger than the sum of its proper divisors (1).
101012112101 is an equidigital number, since it uses as much as digits as its factorization.
101012112101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 101012112101 its reverse (101211210101), we get a palindrome (202223322202).
The spelling of 101012112101 in words is "one hundred one billion, twelve million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •