Base | Representation |
---|---|
bin | 1001010001110001101110… |
… | …1100101000010001001111 |
3 | 1100010012121001210110221211 |
4 | 2110130123230220101033 |
5 | 2314113133033341421 |
6 | 33410140310035251 |
7 | 2101666405302034 |
oct | 224343354502117 |
9 | 40105531713854 |
10 | 10201012012111 |
11 | 3283252382968 |
12 | 1189036348b27 |
13 | 58cc4a02c21b |
14 | 273a357a738b |
15 | 12a54216c9e1 |
hex | 9471bb2844f |
10201012012111 has 4 divisors (see below), whose sum is σ = 10226707256872. Its totient is φ = 10175316767352.
The previous prime is 10201012012097. The next prime is 10201012012141. The reversal of 10201012012111 is 11121021010201.
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 10201012012111 - 239 = 9651256198223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10201012012091 and 10201012012100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201012012141) 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, 12847621785 + ... + 12847622578.
It is an arithmetic number, because the mean of its divisors is an integer number (2556676814218).
Almost surely, 210201012012111 is an apocalyptic number.
10201012012111 is a deficient number, since it is larger than the sum of its proper divisors (25695244761).
10201012012111 is an equidigital number, since it uses as much as digits as its factorization.
10201012012111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25695244760.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10201012012111 its reverse (11121021010201), we get a palindrome (21322033022312).
The spelling of 10201012012111 in words is "ten trillion, two hundred one billion, twelve million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •