Base | Representation |
---|---|
bin | 111000010110101111… |
… | …1000011100100100101 |
3 | 102120101020121202102110 |
4 | 1300231133003210211 |
5 | 3440323140400401 |
6 | 131332525431233 |
7 | 11513020504425 |
oct | 1605537034445 |
9 | 376336552373 |
10 | 121022200101 |
11 | 473639711a0 |
12 | 1b55610b519 |
13 | b548bc81ba |
14 | 5c00dd2485 |
15 | 3234abe9d6 |
hex | 1c2d7c3925 |
121022200101 has 64 divisors (see below), whose sum is σ = 198580193280. Its totient is φ = 64668637440.
The previous prime is 121022200007. The next prime is 121022200121. The reversal of 121022200101 is 101002220121.
It is not a de Polignac number, because 121022200101 - 221 = 121020102949 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121022200121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 420171 + ... + 646983.
It is an arithmetic number, because the mean of its divisors is an integer number (3102815520).
Almost surely, 2121022200101 is an apocalyptic number.
121022200101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
121022200101 is a deficient number, since it is larger than the sum of its proper divisors (77557993179).
121022200101 is a wasteful number, since it uses less digits than its factorization.
121022200101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226906.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 121022200101 its reverse (101002220121), we get a palindrome (222024420222).
It can be divided in two parts, 121022 and 200101, that added together give a palindrome (321123).
The spelling of 121022200101 in words is "one hundred twenty-one billion, twenty-two million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •