Base | Representation |
---|---|
bin | 10111000000101010110001… |
… | …101110001011101010111011 |
3 | 111021022201110202202220001102 |
4 | 113000222301232023222323 |
5 | 101231034122240231021 |
6 | 555123033104242015 |
7 | 30213350102106116 |
oct | 2700526156135273 |
9 | 437281422686042 |
10 | 101201001102011 |
11 | 2a2781158a9aa8 |
12 | b42552261030b |
13 | 44612a0c655b5 |
14 | 1adc22429357d |
15 | ba770c30800b |
hex | 5c0ab1b8babb |
101201001102011 has 4 divisors (see below), whose sum is σ = 102860033907024. Its totient is φ = 99541968297000.
The previous prime is 101201001101987. The next prime is 101201001102031. The reversal of 101201001102011 is 110201100102101.
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 101201001102011 - 230 = 101199927360187 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101201001101983 and 101201001102001.
It is not an unprimeable number, because it can be changed into a prime (101201001102031) 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, 829516402415 + ... + 829516402536.
It is an arithmetic number, because the mean of its divisors is an integer number (25715008476756).
Almost surely, 2101201001102011 is an apocalyptic number.
101201001102011 is a deficient number, since it is larger than the sum of its proper divisors (1659032805013).
101201001102011 is an equidigital number, since it uses as much as digits as its factorization.
101201001102011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1659032805012.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 101201001102011 its reverse (110201100102101), we get a palindrome (211402101204112).
The spelling of 101201001102011 in words is "one hundred one trillion, two hundred one billion, one million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •