Base | Representation |
---|---|
bin | 1001001100011110101110… |
… | …01011101000010000111011 |
3 | 2122121000102001012011002122 |
4 | 10212033113023220100323 |
5 | 10122241100412242334 |
6 | 111000541032151455 |
7 | 4154563655330663 |
oct | 446172713502073 |
9 | 78530361164078 |
10 | 20220021212219 |
11 | 6496298926314 |
12 | 232693823858b |
13 | b389804c693a |
14 | 4dc9233871a3 |
15 | 250e80d6632e |
hex | 1263d72e843b |
20220021212219 has 8 divisors (see below), whose sum is σ = 21100423771392. Its totient is φ = 19339724586600.
The previous prime is 20220021212203. The next prime is 20220021212227. The reversal of 20220021212219 is 91221212002202.
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 20220021212219 - 24 = 20220021212203 is a prime.
It is a super-2 number, since 2×202200212122192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20220021212249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26093207 + ... + 26856944.
It is an arithmetic number, because the mean of its divisors is an integer number (2637552971424).
Almost surely, 220220021212219 is an apocalyptic number.
20220021212219 is a deficient number, since it is larger than the sum of its proper divisors (880402559173).
20220021212219 is a wasteful number, since it uses less digits than its factorization.
20220021212219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52966777.
The product of its (nonzero) digits is 1152, while the sum is 26.
The spelling of 20220021212219 in words is "twenty trillion, two hundred twenty billion, twenty-one million, two hundred twelve thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •