Base | Representation |
---|---|
bin | 111000011100101011… |
… | …0001110000001101100 |
3 | 102120220010002111222121 |
4 | 1300321112032001230 |
5 | 3441230112211340 |
6 | 131404355122324 |
7 | 11520655200025 |
oct | 1607126160154 |
9 | 376803074877 |
10 | 121221210220 |
11 | 47456238470 |
12 | 1b5b08a33a4 |
13 | b57b1c6a76 |
14 | 5c1d5d7c4c |
15 | 32472d094a |
hex | 1c3958e06c |
121221210220 has 48 divisors (see below), whose sum is σ = 286665071616. Its totient is φ = 42658488000.
The previous prime is 121221210211. The next prime is 121221210283. The reversal of 121221210220 is 22012122121.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 121221210194 and 121221210203.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8880366 + ... + 8894005.
It is an arithmetic number, because the mean of its divisors is an integer number (5972188992).
Almost surely, 2121221210220 is an apocalyptic number.
121221210220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121221210220 is an abundant number, since it is smaller than the sum of its proper divisors (165443861396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121221210220 is a wasteful number, since it uses less digits than its factorization.
121221210220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17774422 (or 17774420 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 121221210220 its reverse (22012122121), we get a palindrome (143233332341).
The spelling of 121221210220 in words is "one hundred twenty-one billion, two hundred twenty-one million, two hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •