Base | Representation |
---|---|
bin | 1001010010010011100101… |
… | …1000100011100110011101 |
3 | 1100011002001102110011021121 |
4 | 2110210321120203212131 |
5 | 2314240241100014211 |
6 | 33414242153130541 |
7 | 2102440540032013 |
oct | 224447130434635 |
9 | 40132042404247 |
10 | 10210100001181 |
11 | 3287096301633 |
12 | 118a9519b9a51 |
13 | 590a67aa9052 |
14 | 2742587648b3 |
15 | 12a8c4e2a271 |
hex | 9493962399d |
10210100001181 has 2 divisors, whose sum is σ = 10210100001182. Its totient is φ = 10210100001180.
The previous prime is 10210100001173. The next prime is 10210100001221. The reversal of 10210100001181 is 18110000101201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9704059837956 + 506040163225 = 3115134^2 + 711365^2 .
It is a cyclic number.
It is not a de Polignac number, because 10210100001181 - 23 = 10210100001173 is a prime.
It is a super-2 number, since 2×102101000011812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10210100001161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105050000590 + 5105050000591.
It is an arithmetic number, because the mean of its divisors is an integer number (5105050000591).
Almost surely, 210210100001181 is an apocalyptic number.
It is an amenable number.
10210100001181 is a deficient number, since it is larger than the sum of its proper divisors (1).
10210100001181 is an equidigital number, since it uses as much as digits as its factorization.
10210100001181 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 16.
Adding to 10210100001181 its reverse (18110000101201), we get a palindrome (28320100102382).
The spelling of 10210100001181 in words is "ten trillion, two hundred ten billion, one hundred million, one thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •