Base | Representation |
---|---|
bin | 111000011001101011… |
… | …1111111110111100100 |
3 | 102120122010112222112121 |
4 | 1300303113333313210 |
5 | 3441023434410340 |
6 | 131350415355324 |
7 | 11515330424344 |
oct | 1606327776744 |
9 | 376563488477 |
10 | 121121013220 |
11 | 47404721a29 |
12 | 1b583222b44 |
13 | b5635146bc |
14 | 5c10194d24 |
15 | 323d5dc94a |
hex | 1c335ffde4 |
121121013220 has 12 divisors (see below), whose sum is σ = 254354127804. Its totient is φ = 48448405280.
The previous prime is 121121013217. The next prime is 121121013271. The reversal of 121121013220 is 22310121121.
It can be written as a sum of positive squares in 2 ways, for example, as 27151789284 + 93969223936 = 164778^2 + 306544^2 .
It is a junction number, because it is equal to n+sod(n) for n = 121121013194 and 121121013203.
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, 3028025311 + ... + 3028025350.
It is an arithmetic number, because the mean of its divisors is an integer number (21196177317).
Almost surely, 2121121013220 is an apocalyptic number.
121121013220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121121013220 is an abundant number, since it is smaller than the sum of its proper divisors (133233114584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121121013220 is a wasteful number, since it uses less digits than its factorization.
121121013220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6056050670 (or 6056050668 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 121121013220 its reverse (22310121121), we get a palindrome (143431134341).
The spelling of 121121013220 in words is "one hundred twenty-one billion, one hundred twenty-one million, thirteen thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •