Base | Representation |
---|---|
bin | 1001000000010100001000… |
… | …1100001111010111000101 |
3 | 1022001112020102022102201022 |
4 | 2100011002030033113011 |
5 | 2244204232042402211 |
6 | 33020243344240525 |
7 | 2041216155305363 |
oct | 220050214172705 |
9 | 38045212272638 |
10 | 9901010122181 |
11 | 3177aa4105742 |
12 | 113aa70310145 |
13 | 56a8799bb319 |
14 | 2632d62d2633 |
15 | 122834738bdb |
hex | 9014230f5c5 |
9901010122181 has 2 divisors, whose sum is σ = 9901010122182. Its totient is φ = 9901010122180.
The previous prime is 9901010122177. The next prime is 9901010122243. The reversal of 9901010122181 is 1812210101099.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8756450356900 + 1144559765281 = 2959130^2 + 1069841^2 .
It is a cyclic number.
It is not a de Polignac number, because 9901010122181 - 22 = 9901010122177 is a prime.
It is a super-2 number, since 2×99010101221812 (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 (9901010122681) 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, 4950505061090 + 4950505061091.
It is an arithmetic number, because the mean of its divisors is an integer number (4950505061091).
Almost surely, 29901010122181 is an apocalyptic number.
It is an amenable number.
9901010122181 is a deficient number, since it is larger than the sum of its proper divisors (1).
9901010122181 is an equidigital number, since it uses as much as digits as its factorization.
9901010122181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 35.
The spelling of 9901010122181 in words is "nine trillion, nine hundred one billion, ten million, one hundred twenty-two thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •