Base | Representation |
---|---|
bin | 1001010001110001110000… |
… | …1110111111101110110111 |
3 | 1100010012121200202011222111 |
4 | 2110130130032333232313 |
5 | 2314113142340133421 |
6 | 33410141231111451 |
7 | 2101666545003244 |
oct | 224343416775667 |
9 | 40105550664874 |
10 | 10201021021111 |
11 | 3283257476518 |
12 | 1189039372587 |
13 | 58cc4bb649ab |
14 | 273a36a705cb |
15 | 12a542d4bee1 |
hex | 9471c3bfbb7 |
10201021021111 has 4 divisors (see below), whose sum is σ = 10214604272224. Its totient is φ = 10187437770000.
The previous prime is 10201021021073. The next prime is 10201021021133. The reversal of 10201021021111 is 11112012010201.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10201021021111 - 221 = 10201018923959 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10201021021091 and 10201021021100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201021021811) 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, 6791624430 + ... + 6791625931.
It is an arithmetic number, because the mean of its divisors is an integer number (2553651068056).
Almost surely, 210201021021111 is an apocalyptic number.
10201021021111 is a deficient number, since it is larger than the sum of its proper divisors (13583251113).
10201021021111 is an equidigital number, since it uses as much as digits as its factorization.
10201021021111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13583251112.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10201021021111 its reverse (11112012010201), we get a palindrome (21313033031312).
The spelling of 10201021021111 in words is "ten trillion, two hundred one billion, twenty-one million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •