Base | Representation |
---|---|
bin | 1010111011110010111110… |
… | …0011111110100101000101 |
3 | 1120120022221112010022011220 |
4 | 2232330233203332211011 |
5 | 3033433344311001041 |
6 | 41323004120350553 |
7 | 2350406363654220 |
oct | 256745743764505 |
9 | 46508845108156 |
10 | 12022411422021 |
11 | 3915748907990 |
12 | 1422035315459 |
13 | 692929852050 |
14 | 2d7c602585b7 |
15 | 15cae571bd66 |
hex | aef2f8fe945 |
12022411422021 has 256 divisors, whose sum is σ = 23204501913600. Its totient is φ = 5336146252800.
The previous prime is 12022411422017. The next prime is 12022411422031.
12022411422021 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 12022411422021 - 22 = 12022411422017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12022411421982 and 12022411422000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12022411422031) by changing a digit.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 203192440 + ... + 203251598.
It is an arithmetic number, because the mean of its divisors is an integer number (90642585600).
Almost surely, 212022411422021 is an apocalyptic number.
12022411422021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12022411422021 is a deficient number, since it is larger than the sum of its proper divisors (11182090491579).
12022411422021 is a wasteful number, since it uses less digits than its factorization.
12022411422021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59320.
The product of its (nonzero) digits is 1024, while the sum is 24.
It can be divided in two parts, 1202241 and 1422021, that added together give a palindrome (2624262).
The spelling of 12022411422021 in words is "twelve trillion, twenty-two billion, four hundred eleven million, four hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •