Base | Representation |
---|---|
bin | 10111000000101010111101… |
… | …101001100000001101011011 |
3 | 111021022201222201022000122112 |
4 | 113000222331221200031123 |
5 | 101231040030001431021 |
6 | 555123105013142535 |
7 | 30213355051661051 |
oct | 2700527551401533 |
9 | 437281881260575 |
10 | 101201201202011 |
11 | 2a2782088500a9 |
12 | b42557962aa4b |
13 | 4461303556271 |
14 | 1adc242aa01d1 |
15 | ba771eb81d5b |
hex | 5c0abda6035b |
101201201202011 has 4 divisors (see below), whose sum is σ = 101208996116112. Its totient is φ = 101193406287912.
The previous prime is 101201201201983. The next prime is 101201201202107. The reversal of 101201201202011 is 110202102102101.
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 101201201202011 - 214 = 101201201185627 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101201201202811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3897437576 + ... + 3897463541.
It is an arithmetic number, because the mean of its divisors is an integer number (25302249029028).
Almost surely, 2101201201202011 is an apocalyptic number.
101201201202011 is a deficient number, since it is larger than the sum of its proper divisors (7794914101).
101201201202011 is an equidigital number, since it uses as much as digits as its factorization.
101201201202011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7794914100.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101201201202011 its reverse (110202102102101), we get a palindrome (211403303304112).
The spelling of 101201201202011 in words is "one hundred one trillion, two hundred one billion, two hundred one million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •