Base | Representation |
---|---|
bin | 1001010001110010011100… |
… | …0001011010011111111111 |
3 | 1100010020002022022101012210 |
4 | 2110130213001122133333 |
5 | 2314114030203310421 |
6 | 33410211214231503 |
7 | 2102004203251050 |
oct | 224344701323777 |
9 | 40106068271183 |
10 | 10201202010111 |
11 | 328333a654202 |
12 | 1189089ab5593 |
13 | 58cc7a4c3a88 |
14 | 273a52b04727 |
15 | 12a553b9d576 |
hex | 9472705a7ff |
10201202010111 has 8 divisors (see below), whose sum is σ = 15544688777344. Its totient is φ = 5829258291480.
The previous prime is 10201202010089. The next prime is 10201202010133. The reversal of 10201202010111 is 11101020210201.
It is an interprime number because it is at equal distance from previous prime (10201202010089) and next prime (10201202010133).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10201202010111 - 214 = 10201201993727 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 (10201202011111) 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, 242885762125 + ... + 242885762166.
It is an arithmetic number, because the mean of its divisors is an integer number (1943086097168).
Almost surely, 210201202010111 is an apocalyptic number.
10201202010111 is a deficient number, since it is larger than the sum of its proper divisors (5343486767233).
10201202010111 is an equidigital number, since it uses as much as digits as its factorization.
10201202010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 485771524301.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10201202010111 its reverse (11101020210201), we get a palindrome (21302222220312).
The spelling of 10201202010111 in words is "ten trillion, two hundred one billion, two hundred two million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •