Base | Representation |
---|---|
bin | 111000010110011100… |
… | …0111010011010001101 |
3 | 102120100112210202101010 |
4 | 1300230320322122031 |
5 | 3440313110413401 |
6 | 131331531235433 |
7 | 11512536511011 |
oct | 1605470723215 |
9 | 376315722333 |
10 | 121012201101 |
11 | 47359261860 |
12 | 1b5528a8b79 |
13 | b546b06c2c |
14 | 5bdd94c541 |
15 | 3233c96ed6 |
hex | 1c2ce3a68d |
121012201101 has 32 divisors (see below), whose sum is σ = 179824785408. Its totient is φ = 71755539840.
The previous prime is 121012201097. The next prime is 121012201103. The reversal of 121012201101 is 101102210121.
It is not a de Polignac number, because 121012201101 - 22 = 121012201097 is a prime.
It is a super-2 number, since 2×1210122011012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121012201103) 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 31 ways as a sum of consecutive naturals, for example, 5117361 + ... + 5140953.
It is an arithmetic number, because the mean of its divisors is an integer number (5619524544).
Almost surely, 2121012201101 is an apocalyptic number.
121012201101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
121012201101 is a deficient number, since it is larger than the sum of its proper divisors (58812584307).
121012201101 is a wasteful number, since it uses less digits than its factorization.
121012201101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26961.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 121012201101 its reverse (101102210121), we get a palindrome (222114411222).
The spelling of 121012201101 in words is "one hundred twenty-one billion, twelve million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •