Base | Representation |
---|---|
bin | 1010111011110010010011… |
… | …1100000111100101111110 |
3 | 1120120022111002202201221011 |
4 | 2232330210330013211332 |
5 | 3033433013144413042 |
6 | 41322534312425434 |
7 | 2350402101055402 |
oct | 256744474074576 |
9 | 46508432681834 |
10 | 12022233201022 |
11 | 391566724a900 |
12 | 1421ba56a827a |
13 | 6928cb951b35 |
14 | 2d7c44705102 |
15 | 15cad4c65a17 |
hex | aef24f0797e |
12022233201022 has 12 divisors (see below), whose sum is σ = 19821781187208. Its totient is φ = 5464651454900.
The previous prime is 12022233201019. The next prime is 12022233201029. The reversal of 12022233201022 is 22010233222021.
It is a super-2 number, since 2×120222332010222 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 12022233200984 and 12022233201002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12022233201029) 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, 24839324554 + ... + 24839325037.
It is an arithmetic number, because the mean of its divisors is an integer number (1651815098934).
Almost surely, 212022233201022 is an apocalyptic number.
12022233201022 is a deficient number, since it is larger than the sum of its proper divisors (7799547986186).
12022233201022 is a wasteful number, since it uses less digits than its factorization.
12022233201022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49678649615 (or 49678649604 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 12022233201022 its reverse (22010233222021), we get a palindrome (34032466423043).
The spelling of 12022233201022 in words is "twelve trillion, twenty-two billion, two hundred thirty-three million, two hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •