Base | Representation |
---|---|
bin | 10100111111011111… |
… | …010101010110111000 |
3 | 2011011212000101211120 |
4 | 110333133111112320 |
5 | 332130220440112 |
6 | 14204342425240 |
7 | 1425363652353 |
oct | 247737252670 |
9 | 64155011746 |
10 | 22540015032 |
11 | 96172839a7 |
12 | 4450732220 |
13 | 21829a7702 |
14 | 113b79129a |
15 | 8bdc4ce8c |
hex | 53f7d55b8 |
22540015032 has 16 divisors (see below), whose sum is σ = 56350037640. Its totient is φ = 7513338336.
The previous prime is 22540015031. The next prime is 22540015051. The reversal of 22540015032 is 23051004522.
It is a super-2 number, since 2×225400150322 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 939167293 = 22540015032 / (2 + 2 + 5 + 4 + 0 + 0 + 1 + 5 + 0 + 3 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 22540014993 and 22540015011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22540015031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 469583623 + ... + 469583670.
Almost surely, 222540015032 is an apocalyptic number.
It is an amenable number.
22540015032 is an abundant number, since it is smaller than the sum of its proper divisors (33810022608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22540015032 is a wasteful number, since it uses less digits than its factorization.
22540015032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 939167302 (or 939167298 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 24.
Adding to 22540015032 its reverse (23051004522), we get a palindrome (45591019554).
The spelling of 22540015032 in words is "twenty-two billion, five hundred forty million, fifteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •