Base | Representation |
---|---|
bin | 101101101100111100000001… |
… | …101001010101110100100001 |
3 | 222100200102122200100020010200 |
4 | 231230330001221111310201 |
5 | 202321141403214200001 |
6 | 1551254115035415413 |
7 | 60223533246015423 |
oct | 5554740151256441 |
9 | 870612580306120 |
10 | 201000202100001 |
11 | 59054786025a37 |
12 | 1a663228bb4569 |
13 | 8820312398805 |
14 | 378c666c38813 |
15 | 1838723427086 |
hex | b6cf01a55d21 |
201000202100001 has 12 divisors (see below), whose sum is σ = 291709614003600. Its totient is φ = 133365063003480.
The previous prime is 201000202099987. The next prime is 201000202100003. The reversal of 201000202100001 is 100001202000102.
It is not a de Polignac number, because 201000202100001 - 25 = 201000202099969 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 (201000202100003) 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 11 ways as a sum of consecutive naturals, for example, 52922642151 + ... + 52922645948.
It is an arithmetic number, because the mean of its divisors is an integer number (24309134500300).
Almost surely, 2201000202100001 is an apocalyptic number.
It is an amenable number.
201000202100001 is a deficient number, since it is larger than the sum of its proper divisors (90709411903599).
201000202100001 is a wasteful number, since it uses less digits than its factorization.
201000202100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105845288316 (or 105845288313 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 201000202100001 its reverse (100001202000102), we get a palindrome (301001404100103).
The spelling of 201000202100001 in words is "two hundred one trillion, two hundred two million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •