Base | Representation |
---|---|
bin | 10100011101111110101100… |
… | …111001001001110000111101 |
3 | 102210201221020122111121221220 |
4 | 110131332230321021300331 |
5 | 43244401223234021341 |
6 | 515243044241143553 |
7 | 24650545164422001 |
oct | 2435765471116075 |
9 | 383657218447856 |
10 | 90021120220221 |
11 | 26757819578213 |
12 | a11a84302abb9 |
13 | 3b2cc557a5768 |
14 | 183308ca8c701 |
15 | a619c8b24a66 |
hex | 51dface49c3d |
90021120220221 has 8 divisors (see below), whose sum is σ = 120764529375840. Its totient is φ = 59645895605712.
The previous prime is 90021120220153. The next prime is 90021120220237. The reversal of 90021120220221 is 12202202112009.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 90021120220221 - 213 = 90021120212029 is a prime.
It is a super-3 number, since 3×900211202202213 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 90021120220191 and 90021120220200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (90021120220271) 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, 92046134706 + ... + 92046135683.
It is an arithmetic number, because the mean of its divisors is an integer number (15095566171980).
Almost surely, 290021120220221 is an apocalyptic number.
It is an amenable number.
90021120220221 is a deficient number, since it is larger than the sum of its proper divisors (30743409155619).
90021120220221 is a wasteful number, since it uses less digits than its factorization.
90021120220221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184092270555.
The product of its (nonzero) digits is 576, while the sum is 24.
The spelling of 90021120220221 in words is "ninety trillion, twenty-one billion, one hundred twenty million, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •