Base | Representation |
---|---|
bin | 10100100001001101… |
… | …011111110111101110 |
3 | 2002212110010201210200 |
4 | 110201031133313232 |
5 | 330110144214042 |
6 | 14042114414330 |
7 | 1406655051162 |
oct | 244115376756 |
9 | 62773121720 |
10 | 22032023022 |
11 | 9386558a99 |
12 | 432a5913a6 |
13 | 2101684a19 |
14 | 10d0118ca2 |
15 | 88e356c4c |
hex | 52135fdee |
22032023022 has 12 divisors (see below), whose sum is σ = 47736049920. Its totient is φ = 7344007668.
The previous prime is 22032023003. The next prime is 22032023023.
22032023022 is nontrivially palindromic in base 10.
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 1224001279 = 22032023022 / (2 + 2 + 0 + 3 + 2 + 0 + 2 + 3 + 0 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 22032022986 and 22032023004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22032023023) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 612000622 + ... + 612000657.
It is an arithmetic number, because the mean of its divisors is an integer number (3978004160).
Almost surely, 222032023022 is an apocalyptic number.
22032023022 is an abundant number, since it is smaller than the sum of its proper divisors (25704026898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22032023022 is a wasteful number, since it uses less digits than its factorization.
22032023022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1224001287 (or 1224001284 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 18.
It can be divided in two parts, 220320 and 23022, that added together give a palindrome (243342).
The spelling of 22032023022 in words is "twenty-two billion, thirty-two million, twenty-three thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •