Base | Representation |
---|---|
bin | 1100000011010… |
… | …11001000000001 |
3 | 21001020111222112 |
4 | 12001223020001 |
5 | 201340231311 |
6 | 14010545105 |
7 | 2335232153 |
oct | 601531001 |
9 | 231214875 |
10 | 101102081 |
11 | 52084543 |
12 | 29a38195 |
13 | 17c3b322 |
14 | d5daad3 |
15 | 8d2128b |
hex | 606b201 |
101102081 has 2 divisors, whose sum is σ = 101102082. Its totient is φ = 101102080.
The previous prime is 101102063. The next prime is 101102087. The reversal of 101102081 is 180201101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99700225 + 1401856 = 9985^2 + 1184^2 .
It is an emirp because it is prime and its reverse (180201101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101102081 - 214 = 101085697 is a prime.
It is a super-2 number, since 2×1011020812 = 20443261565061122, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101102087) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50551040 + 50551041.
It is an arithmetic number, because the mean of its divisors is an integer number (50551041).
Almost surely, 2101102081 is an apocalyptic number.
It is an amenable number.
101102081 is a deficient number, since it is larger than the sum of its proper divisors (1).
101102081 is an equidigital number, since it uses as much as digits as its factorization.
101102081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
The square root of 101102081 is about 10054.9530580704. The cubic root of 101102081 is about 465.8577930633.
Adding to 101102081 its reverse (180201101), we get a palindrome (281303182).
It can be divided in two parts, 1011020 and 81, that added together give a palindrome (1011101).
The spelling of 101102081 in words is "one hundred one million, one hundred two thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •