Base | Representation |
---|---|
bin | 1010010000011000011011… |
… | …10010000101010101010000 |
3 | 2221212001111122000101120011 |
4 | 11020030031302011111100 |
5 | 10424002224223113034 |
6 | 115544430404124304 |
7 | 4515256645156504 |
oct | 510141562052520 |
9 | 87761448011504 |
10 | 22553104504144 |
11 | 7205799597275 |
12 | 2642b39096694 |
13 | c77996979a96 |
14 | 57d80caac304 |
15 | 2919d0b74864 |
hex | 14830dc85550 |
22553104504144 has 20 divisors (see below), whose sum is σ = 43713504835200. Its totient is φ = 11272200030560.
The previous prime is 22553104504111. The next prime is 22553104504171. The reversal of 22553104504144 is 44140540135522.
It is a super-2 number, since 2×225531045041442 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22553104504097 and 22553104504106.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 271971094 + ... + 272054005.
It is an arithmetic number, because the mean of its divisors is an integer number (2185675241760).
Almost surely, 222553104504144 is an apocalyptic number.
It is an amenable number.
22553104504144 is a deficient number, since it is larger than the sum of its proper divisors (21160400331056).
22553104504144 is a wasteful number, since it uses less digits than its factorization.
22553104504144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 544027698 (or 544027692 counting only the distinct ones).
The product of its (nonzero) digits is 384000, while the sum is 40.
Adding to 22553104504144 its reverse (44140540135522), we get a palindrome (66693644639666).
The spelling of 22553104504144 in words is "twenty-two trillion, five hundred fifty-three billion, one hundred four million, five hundred four thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •