Base | Representation |
---|---|
bin | 11011100011101101001110… |
… | …100111100001101011001100 |
3 | 120220010200222011020210222012 |
4 | 123203231032213201223030 |
5 | 111341224122241011340 |
6 | 1105434545442440352 |
7 | 34346324536163663 |
oct | 3343551647415314 |
9 | 526120864223865 |
10 | 121201001110220 |
11 | 35689068472219 |
12 | 117156960630b8 |
13 | 528228924cc95 |
14 | 21d0234513dda |
15 | e02ab2191565 |
hex | 6e3b4e9e1acc |
121201001110220 has 12 divisors (see below), whose sum is σ = 254522102331504. Its totient is φ = 48480400444080.
The previous prime is 121201001110219. The next prime is 121201001110237. The reversal of 121201001110220 is 22011100102121.
It is a junction number, because it is equal to n+sod(n) for n = 121201001110195 and 121201001110204.
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, 3030025027736 + ... + 3030025027775.
It is an arithmetic number, because the mean of its divisors is an integer number (21210175194292).
Almost surely, 2121201001110220 is an apocalyptic number.
121201001110220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121201001110220 is an abundant number, since it is smaller than the sum of its proper divisors (133321101221284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121201001110220 is a wasteful number, since it uses less digits than its factorization.
121201001110220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6060050055520 (or 6060050055518 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 121201001110220 its reverse (22011100102121), we get a palindrome (143212101212341).
The spelling of 121201001110220 in words is "one hundred twenty-one trillion, two hundred one billion, one million, one hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •