Base | Representation |
---|---|
bin | 111000011100000100… |
… | …1100000100011011101 |
3 | 102120211201020212100110 |
4 | 1300320021200203131 |
5 | 3441204440213041 |
6 | 131402400120233 |
7 | 11520322234440 |
oct | 1607011404335 |
9 | 376751225313 |
10 | 121201101021 |
11 | 474459530a0 |
12 | 1b5a6006079 |
13 | b576ca5a30 |
14 | 5c1aa81657 |
15 | 324565c516 |
hex | 1c382608dd |
121201101021 has 128 divisors (see below), whose sum is σ = 223455117312. Its totient is φ = 56391552000.
The previous prime is 121201100983. The next prime is 121201101029. The reversal of 121201101021 is 120101102121.
It is not a de Polignac number, because 121201101021 - 27 = 121201100893 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121201100988 and 121201101006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121201101029) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 46776436 + ... + 46779026.
It is an arithmetic number, because the mean of its divisors is an integer number (1745743104).
Almost surely, 2121201101021 is an apocalyptic number.
121201101021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
121201101021 is a deficient number, since it is larger than the sum of its proper divisors (102254016291).
121201101021 is a wasteful number, since it uses less digits than its factorization.
121201101021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3083.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 121201101021 its reverse (120101102121), we get a palindrome (241302203142).
It can be divided in two parts, 121201 and 101021, that added together give a palindrome (222222).
The spelling of 121201101021 in words is "one hundred twenty-one billion, two hundred one million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •