Base | Representation |
---|---|
bin | 110111111011100101… |
… | …1000111001001011001 |
3 | 102111000202001002220002 |
4 | 1233313023013021121 |
5 | 3431441404032301 |
6 | 131102255342345 |
7 | 11451314446661 |
oct | 1576713071131 |
9 | 374022032802 |
10 | 120111002201 |
11 | 46a36590783 |
12 | 1b340b219b5 |
13 | b4321b0948 |
14 | 5b55d9d1a1 |
15 | 31cead016b |
hex | 1bf72c7259 |
120111002201 has 4 divisors (see below), whose sum is σ = 125333219712. Its totient is φ = 114888784692.
The previous prime is 120111002191. The next prime is 120111002227. The reversal of 120111002201 is 102200111021.
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: 102200111021 = 61231 ⋅1669091.
It is a cyclic number.
It is not a de Polignac number, because 120111002201 - 226 = 120043893337 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (120111002261) 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, 2611108721 + ... + 2611108766.
It is an arithmetic number, because the mean of its divisors is an integer number (31333304928).
Almost surely, 2120111002201 is an apocalyptic number.
It is an amenable number.
120111002201 is a deficient number, since it is larger than the sum of its proper divisors (5222217511).
120111002201 is an equidigital number, since it uses as much as digits as its factorization.
120111002201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5222217510.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 120111002201 its reverse (102200111021), we get a palindrome (222311113222).
The spelling of 120111002201 in words is "one hundred twenty billion, one hundred eleven million, two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •