Base | Representation |
---|---|
bin | 111000010110011000… |
… | …1010100010110101100 |
3 | 102120100102001121101210 |
4 | 1300230301110112230 |
5 | 3440312103211340 |
6 | 131331420434420 |
7 | 11512513546464 |
oct | 1605461242654 |
9 | 376312047353 |
10 | 121010210220 |
11 | 47358121aa9 |
12 | 1b5520a8a10 |
13 | b54658a9b3 |
14 | 5bdd590ba4 |
15 | 3233a02180 |
hex | 1c2cc545ac |
121010210220 has 96 divisors (see below), whose sum is σ = 363082341888. Its totient is φ = 30005251072.
The previous prime is 121010210207. The next prime is 121010210261. The reversal of 121010210220 is 22012010121.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 121010210196 and 121010210205.
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 31 ways as a sum of consecutive naturals, for example, 630024 + ... + 799343.
It is an arithmetic number, because the mean of its divisors is an integer number (3782107728).
Almost surely, 2121010210220 is an apocalyptic number.
121010210220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121010210220 is an abundant number, since it is smaller than the sum of its proper divisors (242072131668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121010210220 is a wasteful number, since it uses less digits than its factorization.
121010210220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1429479 (or 1429477 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 121010210220 its reverse (22012010121), we get a palindrome (143022220341).
The spelling of 121010210220 in words is "one hundred twenty-one billion, ten million, two hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •