Base | Representation |
---|---|
bin | 110111111000111010… |
… | …0001101000100111101 |
3 | 102110210110220011111002 |
4 | 1233301310031010331 |
5 | 3431300401023401 |
6 | 131045324540045 |
7 | 11446143416543 |
oct | 1576164150475 |
9 | 373713804432 |
10 | 120021111101 |
11 | 4699a874211 |
12 | 1b3169b1625 |
13 | b419699448 |
14 | 5b4807dd93 |
15 | 31c6c75a6b |
hex | 1bf1d0d13d |
120021111101 has 4 divisors (see below), whose sum is σ = 120087386304. Its totient is φ = 119954835900.
The previous prime is 120021111097. The next prime is 120021111121. The reversal of 120021111101 is 101111120021.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 101111120021 = 189257 ⋅534253.
It is a cyclic number.
It is not a de Polignac number, because 120021111101 - 22 = 120021111097 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120021111121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33134885 + ... + 33138506.
It is an arithmetic number, because the mean of its divisors is an integer number (30021846576).
Almost surely, 2120021111101 is an apocalyptic number.
It is an amenable number.
120021111101 is a deficient number, since it is larger than the sum of its proper divisors (66275203).
120021111101 is an equidigital number, since it uses as much as digits as its factorization.
120021111101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66275202.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 120021111101 its reverse (101111120021), we get a palindrome (221132231122).
The spelling of 120021111101 in words is "one hundred twenty billion, twenty-one million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •