Base | Representation |
---|---|
bin | 10100111000100011… |
… | …010101100101110010 |
3 | 2010212202000010102110 |
4 | 110320203111211302 |
5 | 331410421432200 |
6 | 14145024030150 |
7 | 1422451442142 |
oct | 247043254562 |
9 | 63782003373 |
10 | 22423624050 |
11 | 9567607703 |
12 | 4419762356 |
13 | 21648453c9 |
14 | 112a134922 |
15 | 8b390bb50 |
hex | 5388d5972 |
22423624050 has 24 divisors (see below), whose sum is σ = 55610588016. Its totient is φ = 5979633040.
The previous prime is 22423624033. The next prime is 22423624051. The reversal of 22423624050 is 5042632422.
22423624050 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 22423623999 and 22423624017.
It is not an unprimeable number, because it can be changed into a prime (22423624051) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 74745264 + ... + 74745563.
It is an arithmetic number, because the mean of its divisors is an integer number (2317107834).
Almost surely, 222423624050 is an apocalyptic number.
22423624050 is an abundant number, since it is smaller than the sum of its proper divisors (33186963966).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22423624050 is a wasteful number, since it uses less digits than its factorization.
22423624050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149490842 (or 149490837 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 30.
The spelling of 22423624050 in words is "twenty-two billion, four hundred twenty-three million, six hundred twenty-four thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •