Base | Representation |
---|---|
bin | 1010000111101010001100… |
… | …10000101010100001000001 |
3 | 2220210101221000021022020220 |
4 | 11003311012100222201001 |
5 | 10404044433002143040 |
6 | 115155023421253253 |
7 | 4454520050565105 |
oct | 503650620524101 |
9 | 86711830238226 |
10 | 22253404334145 |
11 | 70aa685668766 |
12 | 25b4a38104229 |
13 | c55643cb979a |
14 | 56d0db6d7905 |
15 | 288cde98e2d0 |
hex | 143d4642a841 |
22253404334145 has 8 divisors (see below), whose sum is σ = 35605446934656. Its totient is φ = 11868482311536.
The previous prime is 22253404334123. The next prime is 22253404334221. The reversal of 22253404334145 is 54143340435222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22253404334145 - 27 = 22253404334017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22253404334097 and 22253404334106.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 741780144457 + ... + 741780144486.
It is an arithmetic number, because the mean of its divisors is an integer number (4450680866832).
Almost surely, 222253404334145 is an apocalyptic number.
It is an amenable number.
22253404334145 is a deficient number, since it is larger than the sum of its proper divisors (13352042600511).
22253404334145 is a wasteful number, since it uses less digits than its factorization.
22253404334145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1483560288951.
The product of its (nonzero) digits is 1382400, while the sum is 42.
Adding to 22253404334145 its reverse (54143340435222), we get a palindrome (76396744769367).
The spelling of 22253404334145 in words is "twenty-two trillion, two hundred fifty-three billion, four hundred four million, three hundred thirty-four thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •