Base | Representation |
---|---|
bin | 1011000000011000001001… |
… | …0111111111111011110101 |
3 | 1120211212002011202120000111 |
4 | 2300012002113333323311 |
5 | 3041231033202431401 |
6 | 41423101232343021 |
7 | 2356163535364564 |
oct | 260060227777365 |
9 | 46755064676014 |
10 | 12101110202101 |
11 | 39460632631a8 |
12 | 14353393a4a71 |
13 | 69a18c21283b |
14 | 2db9a8275bdb |
15 | 15eb9e858e51 |
hex | b01825ffef5 |
12101110202101 has 4 divisors (see below), whose sum is σ = 12109336655104. Its totient is φ = 12092883749100.
The previous prime is 12101110202081. The next prime is 12101110202119. The reversal of 12101110202101 is 10120201110121.
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 a cyclic number.
It is not a de Polignac number, because 12101110202101 - 225 = 12101076647669 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12101110272101) 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, 4113224295 + ... + 4113227236.
It is an arithmetic number, because the mean of its divisors is an integer number (3027334163776).
Almost surely, 212101110202101 is an apocalyptic number.
It is an amenable number.
12101110202101 is a deficient number, since it is larger than the sum of its proper divisors (8226453003).
12101110202101 is an equidigital number, since it uses as much as digits as its factorization.
12101110202101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8226453002.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12101110202101 its reverse (10120201110121), we get a palindrome (22221311312222).
The spelling of 12101110202101 in words is "twelve trillion, one hundred one billion, one hundred ten million, two hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •