Base | Representation |
---|---|
bin | 1001001011111001101010… |
… | …00010011000011101010001 |
3 | 2122112010001011110010200001 |
4 | 10211330311002120131101 |
5 | 10121424321434310001 |
6 | 110543450225530001 |
7 | 4153260554364502 |
oct | 445746502303521 |
9 | 78463034403601 |
10 | 20200121010001 |
11 | 648890676a8a9 |
12 | 2322b037a3901 |
13 | b36b2b6c175a |
14 | 4db99643cba9 |
15 | 2506b8c60001 |
hex | 125f35098751 |
20200121010001 has 8 divisors (see below), whose sum is σ = 21484275369984. Its totient is φ = 18926623533120.
The previous prime is 20200121009993. The next prime is 20200121010029. The reversal of 20200121010001 is 10001012100202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20200121010001 - 23 = 20200121009993 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20200121010001.
It is not an unprimeable number, because it can be changed into a prime (20200121010031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2664216865 + ... + 2664224446.
It is an arithmetic number, because the mean of its divisors is an integer number (2685534421248).
Almost surely, 220200121010001 is an apocalyptic number.
It is an amenable number.
20200121010001 is a deficient number, since it is larger than the sum of its proper divisors (1284154359983).
20200121010001 is a wasteful number, since it uses less digits than its factorization.
20200121010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5328441551.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 20200121010001 its reverse (10001012100202), we get a palindrome (30201133110203).
The spelling of 20200121010001 in words is "twenty trillion, two hundred billion, one hundred twenty-one million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •