Base | Representation |
---|---|
bin | 10101000011011000… |
… | …110110101010100000 |
3 | 2011100102002120212112 |
4 | 111003120312222200 |
5 | 332243442102222 |
6 | 14215040414452 |
7 | 1430116642031 |
oct | 250330665240 |
9 | 64312076775 |
10 | 22605425312 |
11 | 965019a688 |
12 | 446a617428 |
13 | 21933ca112 |
14 | 114633aa88 |
15 | 8c486dbe2 |
hex | 543636aa0 |
22605425312 has 48 divisors (see below), whose sum is σ = 46091711232. Its totient is φ = 10906371840.
The previous prime is 22605425273. The next prime is 22605425321. The reversal of 22605425312 is 21352450622.
It is a super-2 number, since 2×226054253122 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 938 + ... + 212630.
It is an arithmetic number, because the mean of its divisors is an integer number (960243984).
Almost surely, 222605425312 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 22605425312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23045855616).
22605425312 is an abundant number, since it is smaller than the sum of its proper divisors (23486285920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22605425312 is a wasteful number, since it uses less digits than its factorization.
22605425312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211821 (or 211813 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 22605425312 its reverse (21352450622), we get a palindrome (43957875934).
The spelling of 22605425312 in words is "twenty-two billion, six hundred five million, four hundred twenty-five thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •