Base | Representation |
---|---|
bin | 110010010100101000011011… |
… | …010100000111011011100110 |
3 | 1002000121222220220110101211111 |
4 | 302110220123110013123212 |
5 | 213002102102443133110 |
6 | 2102413021053255234 |
7 | 64421564653020655 |
oct | 6224503324073346 |
9 | 1060558826411744 |
10 | 221320123021030 |
11 | 64579378707070 |
12 | 209a53a549451a |
13 | 9665523688987 |
14 | 3c91d45bb719c |
15 | 1a8c09e7b6e8a |
hex | c94a1b5076e6 |
221320123021030 has 256 divisors, whose sum is σ = 457216112885760. Its totient is φ = 76403766067200.
The previous prime is 221320123021021. The next prime is 221320123021141. The reversal of 221320123021030 is 30120321023122.
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 = 221320123020992 and 221320123021010.
It is a congruent number.
It is an unprimeable number.
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 127 ways as a sum of consecutive naturals, for example, 50796445612 + ... + 50796449968.
It is an arithmetic number, because the mean of its divisors is an integer number (1786000440960).
Almost surely, 2221320123021030 is an apocalyptic number.
221320123021030 is an abundant number, since it is smaller than the sum of its proper divisors (235895989864730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
221320123021030 is a wasteful number, since it uses less digits than its factorization.
221320123021030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5655.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 221320123021030 its reverse (30120321023122), we get a palindrome (251440444044152).
The spelling of 221320123021030 in words is "two hundred twenty-one trillion, three hundred twenty billion, one hundred twenty-three million, twenty-one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.339 sec. • engine limits •