Base | Representation |
---|---|
bin | 10100100111001011… |
… | …011000110010011111 |
3 | 2010010102111211220111 |
4 | 110213023120302133 |
5 | 330311311224043 |
6 | 14100052230451 |
7 | 1412312012110 |
oct | 244713306237 |
9 | 63112454814 |
10 | 22132133023 |
11 | 9428015130 |
12 | 435800b427 |
13 | 2119336600 |
14 | 10dd538207 |
15 | 89802e09d |
hex | 5272d8c9f |
22132133023 has 24 divisors (see below), whose sum is σ = 29879162496. Its totient is φ = 15919207200.
The previous prime is 22132133021. The next prime is 22132133027. The reversal of 22132133023 is 32033123122.
It is not a de Polignac number, because 22132133023 - 21 = 22132133021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22132132985 and 22132133003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22132133021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 837373 + ... + 863398.
It is an arithmetic number, because the mean of its divisors is an integer number (1244965104).
Almost surely, 222132133023 is an apocalyptic number.
22132133023 is a deficient number, since it is larger than the sum of its proper divisors (7747029473).
22132133023 is a wasteful number, since it uses less digits than its factorization.
22132133023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1700815 (or 1700802 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 22132133023 its reverse (32033123122), we get a palindrome (54165256145).
Subtracting 22132133023 from its reverse (32033123122), we obtain a palindrome (9900990099).
The spelling of 22132133023 in words is "twenty-two billion, one hundred thirty-two million, one hundred thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •