Base | Representation |
---|---|
bin | 1001000110011001011011… |
… | …10011100011100111010001 |
3 | 2121212000221110122111211111 |
4 | 10203030231303203213101 |
5 | 10110330032401401001 |
6 | 110320534115013321 |
7 | 4133514521015620 |
oct | 443145563434721 |
9 | 77760843574744 |
10 | 20011021122001 |
11 | 6415698812128 |
12 | 22b232a59a241 |
13 | b220536c53c0 |
14 | 4d2777c696b7 |
15 | 24a7ec6e8851 |
hex | 12332dce39d1 |
20011021122001 has 8 divisors (see below), whose sum is σ = 24628949073344. Its totient is φ = 15832895832720.
The previous prime is 20011021121983. The next prime is 20011021122013. The reversal of 20011021122001 is 10022112011002.
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 20011021122001 - 229 = 20010484251089 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is not an unprimeable number, because it can be changed into a prime (20011021126001) 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 7 ways as a sum of consecutive naturals, for example, 109950665415 + ... + 109950665596.
It is an arithmetic number, because the mean of its divisors is an integer number (3078618634168).
Almost surely, 220011021122001 is an apocalyptic number.
It is an amenable number.
20011021122001 is a deficient number, since it is larger than the sum of its proper divisors (4617927951343).
20011021122001 is a wasteful number, since it uses less digits than its factorization.
20011021122001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219901331031.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20011021122001 its reverse (10022112011002), we get a palindrome (30033133133003).
The spelling of 20011021122001 in words is "twenty trillion, eleven billion, twenty-one million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •