Base | Representation |
---|---|
bin | 101111000101010100… |
… | …0110011101101111101 |
3 | 100122222112200102000011 |
4 | 1132022220303231331 |
5 | 3124033202414323 |
6 | 114241022303221 |
7 | 10206414346510 |
oct | 1361250635575 |
9 | 318875612004 |
10 | 101110201213 |
11 | 3997608876a |
12 | 17719727b11 |
13 | 96c4822738 |
14 | 4c72696d77 |
15 | 296b93820d |
hex | 178aa33b7d |
101110201213 has 4 divisors (see below), whose sum is σ = 115554515680. Its totient is φ = 86665886748.
The previous prime is 101110201189. The next prime is 101110201277. The reversal of 101110201213 is 312102011101.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 101110201213 - 29 = 101110200701 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101110201193 and 101110201202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101110204213) 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, 7222157223 + ... + 7222157236.
It is an arithmetic number, because the mean of its divisors is an integer number (28888628920).
Almost surely, 2101110201213 is an apocalyptic number.
It is an amenable number.
101110201213 is a deficient number, since it is larger than the sum of its proper divisors (14444314467).
101110201213 is an equidigital number, since it uses as much as digits as its factorization.
101110201213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14444314466.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 101110201213 its reverse (312102011101), we get a palindrome (413212212314).
The spelling of 101110201213 in words is "one hundred one billion, one hundred ten million, two hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •