Base | Representation |
---|---|
bin | 110111111000111000… |
… | …0110100000010010101 |
3 | 102110210102020000000011 |
4 | 1233301300310002111 |
5 | 3431300134101401 |
6 | 131045253520221 |
7 | 11446133024653 |
oct | 1576160640225 |
9 | 373712200004 |
10 | 120020222101 |
11 | 4699a3172aa |
12 | 1b316643071 |
13 | b419447900 |
14 | 5b47ccbdd3 |
15 | 31c6b4c451 |
hex | 1bf1c34095 |
120020222101 has 12 divisors (see below), whose sum is σ = 130015731108. Its totient is φ = 110742712704.
The previous prime is 120020222099. The next prime is 120020222117. The reversal of 120020222101 is 101222020021.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 24678839025 + 95341383076 = 157095^2 + 308774^2 .
It is not a de Polignac number, because 120020222101 - 21 = 120020222099 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120020222141) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 274351 + ... + 561523.
It is an arithmetic number, because the mean of its divisors is an integer number (10834644259).
Almost surely, 2120020222101 is an apocalyptic number.
It is an amenable number.
120020222101 is a deficient number, since it is larger than the sum of its proper divisors (9995509007).
120020222101 is a wasteful number, since it uses less digits than its factorization.
120020222101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 289672 (or 289659 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 120020222101 its reverse (101222020021), we get a palindrome (221242242122).
The spelling of 120020222101 in words is "one hundred twenty billion, twenty million, two hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •