Base | Representation |
---|---|
bin | 11011100010010000000110… |
… | …001101100111010100001100 |
3 | 120212210010212001111021110112 |
4 | 123202100012031213110030 |
5 | 111333104323020011340 |
6 | 1105321010553055152 |
7 | 34336154503541636 |
oct | 3342200615472414 |
9 | 525703761437415 |
10 | 121101002110220 |
11 | 3564a71265a470 |
12 | 116ba2286b74b8 |
13 | 5275a10a00772 |
14 | 21c9469673a56 |
15 | e001ad0a3065 |
hex | 6e240636750c |
121101002110220 has 24 divisors (see below), whose sum is σ = 277431386653008. Its totient is φ = 44036728040000.
The previous prime is 121101002110217. The next prime is 121101002110301. The reversal of 121101002110220 is 22011200101121.
It is a junction number, because it is equal to n+sod(n) for n = 121101002110195 and 121101002110204.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 275229550031 + ... + 275229550470.
It is an arithmetic number, because the mean of its divisors is an integer number (11559641110542).
Almost surely, 2121101002110220 is an apocalyptic number.
121101002110220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121101002110220 is an abundant number, since it is smaller than the sum of its proper divisors (156330384542788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121101002110220 is a wasteful number, since it uses less digits than its factorization.
121101002110220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 550459100521 (or 550459100519 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 121101002110220 its reverse (22011200101121), we get a palindrome (143112202211341).
The spelling of 121101002110220 in words is "one hundred twenty-one trillion, one hundred one billion, two million, one hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •