Base | Representation |
---|---|
bin | 1100110111101111011… |
… | …0110100111000000110 |
3 | 210010202022201222221200 |
4 | 3031323312310320012 |
5 | 12110324023131042 |
6 | 245325352523330 |
7 | 21655410025005 |
oct | 3157366647006 |
9 | 703668658850 |
10 | 221121302022 |
11 | 85860235005 |
12 | 36a310b0546 |
13 | 17b0c0c571a |
14 | a9b928cc3c |
15 | 5b42882c4c |
hex | 337bdb4e06 |
221121302022 has 48 divisors (see below), whose sum is σ = 496916579952. Its totient is φ = 71004945600.
The previous prime is 221121302011. The next prime is 221121302027. The reversal of 221121302022 is 220203121122.
221121302022 is a `hidden beast` number, since 221 + 121 + 302 + 0 + 22 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 221121301986 and 221121302004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221121302027) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1576368 + ... + 1710899.
It is an arithmetic number, because the mean of its divisors is an integer number (10352428749).
Almost surely, 2221121302022 is an apocalyptic number.
221121302022 is an abundant number, since it is smaller than the sum of its proper divisors (275795277930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
221121302022 is a wasteful number, since it uses less digits than its factorization.
221121302022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3287413 (or 3287410 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 221121302022 its reverse (220203121122), we get a palindrome (441324423144).
The spelling of 221121302022 in words is "two hundred twenty-one billion, one hundred twenty-one million, three hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •