Base | Representation |
---|---|
bin | 1010111011110001100001… |
… | …0011000011110011101101 |
3 | 1120120021221022200110010221 |
4 | 2232330120103003303231 |
5 | 3033432044401023041 |
6 | 41322501254531341 |
7 | 2350363614245245 |
oct | 256743023036355 |
9 | 46507838613127 |
10 | 12022021111021 |
11 | 391556855a509 |
12 | 1421b46666b51 |
13 | 692896a238ac |
14 | 2d7c24496b25 |
15 | 15cac131e2d1 |
hex | aef184c3ced |
12022021111021 has 8 divisors (see below), whose sum is σ = 12785274593280. Its totient is φ = 11264998269888.
The previous prime is 12022021110997. The next prime is 12022021111063. The reversal of 12022021111021 is 12011112022021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12022021111021 - 211 = 12022021108973 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12022021110986 and 12022021111004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12022021111421) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1557656301 + ... + 1557664018.
It is an arithmetic number, because the mean of its divisors is an integer number (1598159324160).
Almost surely, 212022021111021 is an apocalyptic number.
It is an amenable number.
12022021111021 is a deficient number, since it is larger than the sum of its proper divisors (763253482259).
12022021111021 is a wasteful number, since it uses less digits than its factorization.
12022021111021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3115320563.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 12022021111021 its reverse (12011112022021), we get a palindrome (24033133133042).
The spelling of 12022021111021 in words is "twelve trillion, twenty-two billion, twenty-one million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •