Base | Representation |
---|---|
bin | 101111000101000100… |
… | …1100100011011000101 |
3 | 100122221222021100122201 |
4 | 1132022021210123011 |
5 | 3124024103341401 |
6 | 114240130554501 |
7 | 10206254631526 |
oct | 1361211443305 |
9 | 318858240581 |
10 | 101102012101 |
11 | 399714a5102 |
12 | 17716a38a31 |
13 | 96c2c161cc |
14 | 4c7156484d |
15 | 296ad6bb01 |
hex | 178a2646c5 |
101102012101 has 2 divisors, whose sum is σ = 101102012102. Its totient is φ = 101102012100.
The previous prime is 101102012087. The next prime is 101102012107. The reversal of 101102012101 is 101210201101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 68701652100 + 32400360001 = 262110^2 + 180001^2 .
It is a cyclic number.
It is not a de Polignac number, because 101102012101 - 213 = 101102003909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101102012107) 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, 50551006050 + 50551006051.
It is an arithmetic number, because the mean of its divisors is an integer number (50551006051).
Almost surely, 2101102012101 is an apocalyptic number.
It is an amenable number.
101102012101 is a deficient number, since it is larger than the sum of its proper divisors (1).
101102012101 is an equidigital number, since it uses as much as digits as its factorization.
101102012101 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 10.
Adding to 101102012101 its reverse (101210201101), we get a palindrome (202312213202).
The spelling of 101102012101 in words is "one hundred one billion, one hundred two million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •