Base | Representation |
---|---|
bin | 1001010001110010000110… |
… | …0111000010110000001101 |
3 | 1100010012211222110022021112 |
4 | 2110130201213002300031 |
5 | 2314113333432223041 |
6 | 33410154212141405 |
7 | 2102002021416503 |
oct | 224344147026015 |
9 | 40105758408245 |
10 | 10201111211021 |
11 | 32832a3377535 |
12 | 1189063607865 |
13 | 58cc647521c3 |
14 | 273a44a2a673 |
15 | 12a54ac14deb |
hex | 947219c2c0d |
10201111211021 has 8 divisors (see below), whose sum is σ = 10284296899584. Its totient is φ = 10117970241120.
The previous prime is 10201111210973. The next prime is 10201111211041. The reversal of 10201111211021 is 12011211110201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10201111211021 - 210 = 10201111209997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10201111210987 and 10201111211005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201111211041) 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, 10721495 + ... + 11634116.
It is an arithmetic number, because the mean of its divisors is an integer number (1285537112448).
Almost surely, 210201111211021 is an apocalyptic number.
It is an amenable number.
10201111211021 is a deficient number, since it is larger than the sum of its proper divisors (83185688563).
10201111211021 is a wasteful number, since it uses less digits than its factorization.
10201111211021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22359331.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 10201111211021 its reverse (12011211110201), we get a palindrome (22212322321222).
The spelling of 10201111211021 in words is "ten trillion, two hundred one billion, one hundred eleven million, two hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •