Base | Representation |
---|---|
bin | 111000010110101101… |
… | …0110111100000010101 |
3 | 102120101011112222020210 |
4 | 1300231122313200111 |
5 | 3440322400231401 |
6 | 131332450120033 |
7 | 11513005252314 |
oct | 1605532674025 |
9 | 376334488223 |
10 | 121021102101 |
11 | 47363291259 |
12 | 1b555880019 |
13 | b5489024b3 |
14 | 5c00bc827b |
15 | 32349544d6 |
hex | 1c2d6b7815 |
121021102101 has 8 divisors (see below), whose sum is σ = 161826489504. Its totient is φ = 80448224720.
The previous prime is 121021102099. The next prime is 121021102177. The reversal of 121021102101 is 101201120121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121021102101 - 21 = 121021102099 is a prime.
It is a super-2 number, since 2×1210211021012 (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 (121021102801) 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 7 ways as a sum of consecutive naturals, for example, 58126290 + ... + 58128371.
It is an arithmetic number, because the mean of its divisors is an integer number (20228311188).
Almost surely, 2121021102101 is an apocalyptic number.
It is an amenable number.
121021102101 is a deficient number, since it is larger than the sum of its proper divisors (40805387403).
121021102101 is a wasteful number, since it uses less digits than its factorization.
121021102101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116255011.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 121021102101 its reverse (101201120121), we get a palindrome (222222222222).
The spelling of 121021102101 in words is "one hundred twenty-one billion, twenty-one million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •