Base | Representation |
---|---|
bin | 1010010110001101110001… |
… | …10100010111001100100001 |
3 | 2222120012212111110122000000 |
4 | 11023012320310113030201 |
5 | 10440243223340014103 |
6 | 120220455542050213 |
7 | 4535613665061642 |
oct | 513067064271441 |
9 | 88505774418000 |
10 | 22753542501153 |
11 | 72827a5616072 |
12 | 2675957419969 |
13 | c9085a952489 |
14 | 5893c50056c9 |
15 | 296d127b5aa3 |
hex | 14b1b8d17321 |
22753542501153 has 14 divisors (see below), whose sum is σ = 34114707756594. Its totient is φ = 15169028333616.
The previous prime is 22753542501073. The next prime is 22753542501227. The reversal of 22753542501153 is 35110524535722.
22753542501153 is a `hidden beast` number, since 2 + 2 + 7 + 5 + 3 + 542 + 50 + 1 + 1 + 53 = 666.
It can be written as a sum of positive squares in only one way, i.e., 21302729478144 + 1450813023009 = 4615488^2 + 1204497^2 .
It is not a de Polignac number, because 22753542501153 - 217 = 22753542370081 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22753542501099 and 22753542501108.
It is not an unprimeable number, because it can be changed into a prime (22753542501353) by changing a digit.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 15605995500 + ... + 15605996957.
Almost surely, 222753542501153 is an apocalyptic number.
It is an amenable number.
22753542501153 is a deficient number, since it is larger than the sum of its proper divisors (11361165255441).
22753542501153 is an frugal number, since it uses more digits than its factorization.
22753542501153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31211992475 (or 31211992460 counting only the distinct ones).
The product of its (nonzero) digits is 1260000, while the sum is 45.
The spelling of 22753542501153 in words is "twenty-two trillion, seven hundred fifty-three billion, five hundred forty-two million, five hundred one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •