Base | Representation |
---|---|
bin | 11101011001100001001… |
… | …00100011001011000101 |
3 | 10120120022211221121220111 |
4 | 32230300210203023011 |
5 | 113022222320432211 |
6 | 2052014234433021 |
7 | 132660006023044 |
oct | 16546044431305 |
9 | 3516284847814 |
10 | 1010132202181 |
11 | 35a438326403 |
12 | 14392b292771 |
13 | 74341492c4b |
14 | 36c67d8055b |
15 | 1b42103a421 |
hex | eb309232c5 |
1010132202181 has 2 divisors, whose sum is σ = 1010132202182. Its totient is φ = 1010132202180.
The previous prime is 1010132202179. The next prime is 1010132202241. The reversal of 1010132202181 is 1812022310101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 951853896900 + 58278305281 = 975630^2 + 241409^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010132202181 - 21 = 1010132202179 is a prime.
It is a super-2 number, since 2×10101322021812 (a number of 25 digits) contains 22 as substring.
Together with 1010132202179, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010132202481) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505066101090 + 505066101091.
It is an arithmetic number, because the mean of its divisors is an integer number (505066101091).
Almost surely, 21010132202181 is an apocalyptic number.
It is an amenable number.
1010132202181 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010132202181 is an equidigital number, since it uses as much as digits as its factorization.
1010132202181 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 22.
Adding to 1010132202181 its reverse (1812022310101), we get a palindrome (2822154512282).
The spelling of 1010132202181 in words is "one trillion, ten billion, one hundred thirty-two million, two hundred two thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •