Base | Representation |
---|---|
bin | 1001010001110010000110… |
… | …1010110110101010101011 |
3 | 1100010012212001100001202010 |
4 | 2110130201222312222223 |
5 | 2314113334211210331 |
6 | 33410154245411003 |
7 | 2102002033050315 |
oct | 224344152665253 |
9 | 40105761301663 |
10 | 10201112210091 |
11 | 32832a399a110 |
12 | 1189063a09a63 |
13 | 58cc64a11b7a |
14 | 273a44c0a7b5 |
15 | 12a54ad60e46 |
hex | 94721ab6aab |
10201112210091 has 64 divisors (see below), whose sum is σ = 15871235904000. Its totient is φ = 5759432448000.
The previous prime is 10201112210077. The next prime is 10201112210161. The reversal of 10201112210091 is 19001221110201.
10201112210091 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10201112210091 - 29 = 10201112209579 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10201112210011) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 196531060 + ... + 196582958.
It is an arithmetic number, because the mean of its divisors is an integer number (247988061000).
Almost surely, 210201112210091 is an apocalyptic number.
10201112210091 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10201112210091 is a deficient number, since it is larger than the sum of its proper divisors (5670123693909).
10201112210091 is a wasteful number, since it uses less digits than its factorization.
10201112210091 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55500.
The product of its (nonzero) digits is 72, while the sum is 21.
Adding to 10201112210091 its reverse (19001221110201), we get a palindrome (29202333320292).
The spelling of 10201112210091 in words is "ten trillion, two hundred one billion, one hundred twelve million, two hundred ten thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •