Base | Representation |
---|---|
bin | 101101101110011001111111… |
… | …110000010111110001000001 |
3 | 222101001002002120112022201110 |
4 | 231232121333300113301001 |
5 | 202324320024120320001 |
6 | 1551412323153153533 |
7 | 60234034532025066 |
oct | 5556317760276101 |
9 | 871032076468643 |
10 | 201101102120001 |
11 | 590935534a7416 |
12 | 1a67a8a825b8a9 |
13 | 88299a24aaa65 |
14 | 37934b961cc6d |
15 | 183b17b6943d6 |
hex | b6e67fc17c41 |
201101102120001 has 4 divisors (see below), whose sum is σ = 268134802826672. Its totient is φ = 134067401413332.
The previous prime is 201101102119969. The next prime is 201101102120021. The reversal of 201101102120001 is 100021201101102.
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 201101102120001 - 25 = 201101102119969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201101102120021) 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, 33516850353331 + ... + 33516850353336.
It is an arithmetic number, because the mean of its divisors is an integer number (67033700706668).
Almost surely, 2201101102120001 is an apocalyptic number.
It is an amenable number.
201101102120001 is a deficient number, since it is larger than the sum of its proper divisors (67033700706671).
201101102120001 is an equidigital number, since it uses as much as digits as its factorization.
201101102120001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67033700706670.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 201101102120001 its reverse (100021201101102), we get a palindrome (301122303221103).
The spelling of 201101102120001 in words is "two hundred one trillion, one hundred one billion, one hundred two million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •