Base | Representation |
---|---|
bin | 1010000000100101100100… |
… | …11101101000001110110011 |
3 | 2212221011201002001011110100 |
4 | 11000102302131220032303 |
5 | 10341104303033123430 |
6 | 114451235143203443 |
7 | 4431125251435254 |
oct | 500226235501663 |
9 | 85834632034410 |
10 | 22010406536115 |
11 | 7016619752498 |
12 | 2575920746583 |
13 | c38759824b8a |
14 | 561448c56b2b |
15 | 28281b776960 |
hex | 1404b27683b3 |
22010406536115 has 48 divisors (see below), whose sum is σ = 39043110832128. Its totient is φ = 11465527848768.
The previous prime is 22010406536047. The next prime is 22010406536117. The reversal of 22010406536115 is 51163560401022.
22010406536115 is a `hidden beast` number, since 2 + 2 + 0 + 1 + 0 + 4 + 0 + 6 + 536 + 115 = 666.
It is not a de Polignac number, because 22010406536115 - 228 = 22010138100659 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22010406536115.
It is not an unprimeable number, because it can be changed into a prime (22010406536117) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9654607 + ... + 11714616.
It is an arithmetic number, because the mean of its divisors is an integer number (813398142336).
Almost surely, 222010406536115 is an apocalyptic number.
22010406536115 is a deficient number, since it is larger than the sum of its proper divisors (17032704296013).
22010406536115 is a wasteful number, since it uses less digits than its factorization.
22010406536115 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21369768 (or 21369765 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 36.
Adding to 22010406536115 its reverse (51163560401022), we get a palindrome (73173966937137).
The spelling of 22010406536115 in words is "twenty-two trillion, ten billion, four hundred six million, five hundred thirty-six thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •