Base | Representation |
---|---|
bin | 111000011100011001… |
… | …1111011001011001110 |
3 | 102120212111011202212120 |
4 | 1300320303323023032 |
5 | 3441220312020420 |
6 | 131403434313410 |
7 | 11520515604552 |
oct | 1607063731316 |
9 | 376774152776 |
10 | 121212220110 |
11 | 47451158023 |
12 | 1b5a9888866 |
13 | b579399a87 |
14 | 5c1c337862 |
15 | 3246606d40 |
hex | 1c38cfb2ce |
121212220110 has 32 divisors (see below), whose sum is σ = 293199962112. Its totient is φ = 32068743840.
The previous prime is 121212220099. The next prime is 121212220111. The reversal of 121212220110 is 11022212121.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 121212220110.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121212220111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15903306 + ... + 15910925.
It is an arithmetic number, because the mean of its divisors is an integer number (9162498816).
Almost surely, 2121212220110 is an apocalyptic number.
121212220110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121212220110 is an abundant number, since it is smaller than the sum of its proper divisors (171987742002).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121212220110 is a wasteful number, since it uses less digits than its factorization.
121212220110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31814368.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 121212220110 its reverse (11022212121), we get a palindrome (132234432231).
The spelling of 121212220110 in words is "one hundred twenty-one billion, two hundred twelve million, two hundred twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •