Base | Representation |
---|---|
bin | 111000011100000110… |
… | …0111110110001010100 |
3 | 102120211202222002220112 |
4 | 1300320030332301110 |
5 | 3441210203324340 |
6 | 131402431422152 |
7 | 11520333045203 |
oct | 1607014766124 |
9 | 376752862815 |
10 | 121202011220 |
11 | 47446414a24 |
12 | 1b5a6384958 |
13 | b577234104 |
14 | 5c1ac3b23a |
15 | 324578c065 |
hex | 1c3833ec54 |
121202011220 has 12 divisors (see below), whose sum is σ = 254524223604. Its totient is φ = 48480804480.
The previous prime is 121202011159. The next prime is 121202011367. The reversal of 121202011220 is 22110202121.
It can be written as a sum of positive squares in 2 ways, for example, as 71890479376 + 49311531844 = 268124^2 + 222062^2 .
It is a junction number, because it is equal to n+sod(n) for n = 121202011195 and 121202011204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3030050261 + ... + 3030050300.
It is an arithmetic number, because the mean of its divisors is an integer number (21210351967).
Almost surely, 2121202011220 is an apocalyptic number.
121202011220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121202011220 is an abundant number, since it is smaller than the sum of its proper divisors (133322212384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121202011220 is a wasteful number, since it uses less digits than its factorization.
121202011220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6060100570 (or 6060100568 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 121202011220 its reverse (22110202121), we get a palindrome (143312213341).
The spelling of 121202011220 in words is "one hundred twenty-one billion, two hundred two million, eleven thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •