Base | Representation |
---|---|
bin | 101101101110011010111011… |
… | …001110111111000011101001 |
3 | 222101001011200010012221010000 |
4 | 231232122323032333003221 |
5 | 202324324100100013001 |
6 | 1551413010201213213 |
7 | 60234101336622123 |
oct | 5556327316770351 |
9 | 871034603187100 |
10 | 201102100001001 |
11 | 59093a15803161 |
12 | 1a67ab26491209 |
13 | 8829b011555a4 |
14 | 3793571d78213 |
15 | 183b1d90a7a86 |
hex | b6e6bb3bf0e9 |
201102100001001 has 20 divisors (see below), whose sum is σ = 301359450279492. Its totient is φ = 133645138995168.
The previous prime is 201102100000973. The next prime is 201102100001069. The reversal of 201102100001001 is 100100001201102.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 4433871416976 + 196668228584025 = 2105676^2 + 14023845^2 .
It is not a de Polignac number, because 201102100001001 - 217 = 201102099869929 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (201102100001081) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 3915971130 + ... + 3916022483.
Almost surely, 2201102100001001 is an apocalyptic number.
It is an amenable number.
201102100001001 is a deficient number, since it is larger than the sum of its proper divisors (100257350278491).
201102100001001 is an equidigital number, since it uses as much as digits as its factorization.
201102100001001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7831993942 (or 7831993933 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 201102100001001 its reverse (100100001201102), we get a palindrome (301202101202103).
The spelling of 201102100001001 in words is "two hundred one trillion, one hundred two billion, one hundred million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •