Base | Representation |
---|---|
bin | 1001001011111001100111… |
… | …10110000011010000001001 |
3 | 2122112002222202210112101100 |
4 | 10211330303312003100021 |
5 | 10121424301324001301 |
6 | 110543444233012013 |
7 | 4153260222325053 |
oct | 445746366032011 |
9 | 78462882715340 |
10 | 20200101000201 |
11 | 64888a6443181 |
12 | 2322ab8b54009 |
13 | b36b27506a35 |
14 | 4db9939108d3 |
15 | 2506b710b286 |
hex | 125f33d83409 |
20200101000201 has 12 divisors (see below), whose sum is σ = 29798730554112. Its totient is φ = 13180207744536.
The previous prime is 20200101000169. The next prime is 20200101000227. The reversal of 20200101000201 is 10200010100202.
It is not a de Polignac number, because 20200101000201 - 25 = 20200101000169 is a prime.
It is a super-3 number, since 3×202001010002013 (a number of 41 digits) contains 333 as substring.
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 (20200101400201) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 23877187521 + ... + 23877188366.
It is an arithmetic number, because the mean of its divisors is an integer number (2483227546176).
Almost surely, 220200101000201 is an apocalyptic number.
It is an amenable number.
20200101000201 is a deficient number, since it is larger than the sum of its proper divisors (9598629553911).
20200101000201 is a wasteful number, since it uses less digits than its factorization.
20200101000201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47754375940 (or 47754375937 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 20200101000201 its reverse (10200010100202), we get a palindrome (30400111100403).
The spelling of 20200101000201 in words is "twenty trillion, two hundred billion, one hundred one million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •