Base | Representation |
---|---|
bin | 11011100011110110101000… |
… | …101011110000001000000100 |
3 | 120220011200001010001100210121 |
4 | 123203312220223300020010 |
5 | 111341410314114231040 |
6 | 1105443340034031324 |
7 | 34350133051201450 |
oct | 3343665053601004 |
9 | 526150033040717 |
10 | 121211102102020 |
11 | 35692381195927 |
12 | 11717634a18544 |
13 | 5283208b3a4c8 |
14 | 21d0911c45660 |
15 | e02ea3d4cc4a |
hex | 6e3da8af0204 |
121211102102020 has 48 divisors (see below), whose sum is σ = 306217521106560. Its totient is φ = 39370824140544.
The previous prime is 121211102101939. The next prime is 121211102102107. The reversal of 121211102102020 is 20201201112121.
It is a junction number, because it is equal to n+sod(n) for n = 121211102101985 and 121211102102003.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22784039089 + ... + 22784044408.
It is an arithmetic number, because the mean of its divisors is an integer number (6379531689720).
Almost surely, 2121211102102020 is an apocalyptic number.
121211102102020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121211102102020 is an abundant number, since it is smaller than the sum of its proper divisors (185006419004540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121211102102020 is a wasteful number, since it uses less digits than its factorization.
121211102102020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45568083532 (or 45568083530 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 121211102102020 its reverse (20201201112121), we get a palindrome (141412303214141).
The spelling of 121211102102020 in words is "one hundred twenty-one trillion, two hundred eleven billion, one hundred two million, one hundred two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •