Base | Representation |
---|---|
bin | 1010000100101001100111… |
… | …00001000110010010110101 |
3 | 2220102112001022211110021222 |
4 | 11002110303201012102311 |
5 | 10400401210212110041 |
6 | 115035324024120125 |
7 | 4444166625056666 |
oct | 502246341062265 |
9 | 86375038743258 |
10 | 22150010660021 |
11 | 706a848628002 |
12 | 25989a1906045 |
13 | c4897738a65a |
14 | 5680cda7536d |
15 | 28628c84b74b |
hex | 1425338464b5 |
22150010660021 has 2 divisors, whose sum is σ = 22150010660022. Its totient is φ = 22150010660020.
The previous prime is 22150010659967. The next prime is 22150010660147. The reversal of 22150010660021 is 12006601005122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22116845151025 + 33165508996 = 4702855^2 + 182114^2 .
It is a cyclic number.
It is not a de Polignac number, because 22150010660021 - 242 = 17751964148917 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22150010660221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11075005330010 + 11075005330011.
It is an arithmetic number, because the mean of its divisors is an integer number (11075005330011).
Almost surely, 222150010660021 is an apocalyptic number.
It is an amenable number.
22150010660021 is a deficient number, since it is larger than the sum of its proper divisors (1).
22150010660021 is an equidigital number, since it uses as much as digits as its factorization.
22150010660021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 22150010660021 its reverse (12006601005122), we get a palindrome (34156611665143).
The spelling of 22150010660021 in words is "twenty-two trillion, one hundred fifty billion, ten million, six hundred sixty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •