Base | Representation |
---|---|
bin | 10101000110011000… |
… | …000010000000000000 |
3 | 2011110220101202000022 |
4 | 111012120002000000 |
5 | 332344304304443 |
6 | 14224030513012 |
7 | 1431265631444 |
oct | 250630020000 |
9 | 64426352008 |
10 | 22655541248 |
11 | 967650a50a |
12 | 4483365768 |
13 | 21a08c6212 |
14 | 114cc64824 |
15 | 8c8e6ce68 |
hex | 546602000 |
22655541248 has 42 divisors (see below), whose sum is σ = 45335578239. Its totient is φ = 11320958976.
The previous prime is 22655541239. The next prime is 22655541263. The reversal of 22655541248 is 84214555622.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in only one way, i.e., 11327770624 + 11327770624 = 106432^2 + 106432^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=106432.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22655541199 and 22655541208.
It is an unprimeable number.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 13622465 + ... + 13624127.
Almost surely, 222655541248 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22655541248
22655541248 is an abundant number, since it is smaller than the sum of its proper divisors (22680036991).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22655541248 is an frugal number, since it uses more digits than its factorization.
22655541248 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3352 (or 1665 counting only the distinct ones).
The product of its digits is 768000, while the sum is 44.
The spelling of 22655541248 in words is "twenty-two billion, six hundred fifty-five million, five hundred forty-one thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •