Base | Representation |
---|---|
bin | 110111111011111001… |
… | …0000011010011110101 |
3 | 102111001110020201111110 |
4 | 1233313302003103311 |
5 | 3432002012210401 |
6 | 131103302225233 |
7 | 11451500303424 |
oct | 1576762032365 |
9 | 374043221443 |
10 | 120121210101 |
11 | 46a41323062 |
12 | 1b344425219 |
13 | b434346019 |
14 | 5b574992bb |
15 | 31d09499d6 |
hex | 1bf7c834f5 |
120121210101 has 8 divisors (see below), whose sum is σ = 160861010080. Its totient is φ = 79731108432.
The previous prime is 120121210087. The next prime is 120121210109. The reversal of 120121210101 is 101012121021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 120121210101 - 26 = 120121210037 is a prime.
It is a super-2 number, since 2×1201212101012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120121210109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 87423775 + ... + 87425148.
It is an arithmetic number, because the mean of its divisors is an integer number (20107626260).
Almost surely, 2120121210101 is an apocalyptic number.
It is an amenable number.
120121210101 is a deficient number, since it is larger than the sum of its proper divisors (40739799979).
120121210101 is a wasteful number, since it uses less digits than its factorization.
120121210101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174849155.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 120121210101 its reverse (101012121021), we get a palindrome (221133331122).
The spelling of 120121210101 in words is "one hundred twenty billion, one hundred twenty-one million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •