Base | Representation |
---|---|
bin | 101101101110011011000001… |
… | …110010111110101100100001 |
3 | 222101001011221210101112112202 |
4 | 231232123001302332230201 |
5 | 202324324311241200001 |
6 | 1551413025133102545 |
7 | 60234104144505350 |
oct | 5556330162765441 |
9 | 871034853345482 |
10 | 201102210100001 |
11 | 59093a71972171 |
12 | 1a67ab57327a55 |
13 | 8829b1abc3a22 |
14 | 3793582837997 |
15 | 183b1e3aa496b |
hex | b6e6c1cbeb21 |
201102210100001 has 4 divisors (see below), whose sum is σ = 229831097257152. Its totient is φ = 172373322942852.
The previous prime is 201102210099961. The next prime is 201102210100061. The reversal of 201102210100001 is 100001012201102.
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 201102210100001 - 218 = 201102209837857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201102210100061) 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, 14364443578565 + ... + 14364443578578.
It is an arithmetic number, because the mean of its divisors is an integer number (57457774314288).
Almost surely, 2201102210100001 is an apocalyptic number.
It is an amenable number.
201102210100001 is a deficient number, since it is larger than the sum of its proper divisors (28728887157151).
201102210100001 is an equidigital number, since it uses as much as digits as its factorization.
201102210100001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28728887157150.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 201102210100001 its reverse (100001012201102), we get a palindrome (301103222301103).
The spelling of 201102210100001 in words is "two hundred one trillion, one hundred two billion, two hundred ten million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •