Base | Representation |
---|---|
bin | 1001010001110101110111… |
… | …0000000010001110010111 |
3 | 1100010022110022001022110212 |
4 | 2110131131300002032113 |
5 | 2314122420232413421 |
6 | 33410442254240035 |
7 | 2102036022612536 |
oct | 224353560021627 |
9 | 40108408038425 |
10 | 10202120201111 |
11 | 3283770980743 |
12 | 11892a54b601b |
13 | 5900957b9367 |
14 | 273adca3831d |
15 | 12a5a95bee5b |
hex | 9475dc02397 |
10202120201111 has 8 divisors (see below), whose sum is σ = 10235070598800. Its totient is φ = 10169174628288.
The previous prime is 10202120200981. The next prime is 10202120201113. The reversal of 10202120201111 is 11110202120201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10202120201111 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 (10202120201113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3053840 + ... + 5452538.
It is an arithmetic number, because the mean of its divisors is an integer number (1279383824850).
Almost surely, 210202120201111 is an apocalyptic number.
10202120201111 is a deficient number, since it is larger than the sum of its proper divisors (32950397689).
10202120201111 is a wasteful number, since it uses less digits than its factorization.
10202120201111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2412433.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10202120201111 its reverse (11110202120201), we get a palindrome (21312322321312).
It can be divided in two parts, 10202120201 and 111, that multiplied together give a palindrome (1132435342311).
The spelling of 10202120201111 in words is "ten trillion, two hundred two billion, one hundred twenty million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •