Base | Representation |
---|---|
bin | 11011010010011000001101… |
… | …111100000000101100001111 |
3 | 120201220212022212201210111110 |
4 | 123102120031330000230033 |
5 | 111212221402231120421 |
6 | 1103123532425023103 |
7 | 34164310611005505 |
oct | 3322301574005417 |
9 | 521825285653443 |
10 | 120010210020111 |
11 | 3526a053995464 |
12 | 11562948624a93 |
13 | 51c6bb679c1a8 |
14 | 218c74d062675 |
15 | dd1b1ab9ba76 |
hex | 6d260df00b0f |
120010210020111 has 4 divisors (see below), whose sum is σ = 160013613360152. Its totient is φ = 80006806680072.
The previous prime is 120010210020067. The next prime is 120010210020131. The reversal of 120010210020111 is 111020012010021.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 120010210020111 - 29 = 120010210019599 is a prime.
It is a super-3 number, since 3×1200102100201113 (a number of 43 digits) contains 333 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 (120010210020131) 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, 20001701670016 + ... + 20001701670021.
It is an arithmetic number, because the mean of its divisors is an integer number (40003403340038).
Almost surely, 2120010210020111 is an apocalyptic number.
120010210020111 is a deficient number, since it is larger than the sum of its proper divisors (40003403340041).
120010210020111 is an equidigital number, since it uses as much as digits as its factorization.
120010210020111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40003403340040.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 120010210020111 its reverse (111020012010021), we get a palindrome (231030222030132).
The spelling of 120010210020111 in words is "one hundred twenty trillion, ten billion, two hundred ten million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •