Base | Representation |
---|---|
bin | 1001001001000001010000… |
… | …01111001001000101100101 |
3 | 2122011122111202100112002021 |
4 | 10210200220033021011211 |
5 | 10113314044213101201 |
6 | 110430154501343141 |
7 | 4143154353615013 |
oct | 444405017110545 |
9 | 78148452315067 |
10 | 20101122003301 |
11 | 644a924376899 |
12 | 2307895107ab1 |
13 | b2a6b23a9351 |
14 | 4d6c843078b3 |
15 | 24cd22850ea1 |
hex | 1248283c9165 |
20101122003301 has 8 divisors (see below), whose sum is σ = 20175472114304. Its totient is φ = 20026773188640.
The previous prime is 20101122003229. The next prime is 20101122003311. The reversal of 20101122003301 is 10330022110102.
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 20101122003301 - 213 = 20101121995109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20101122003311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 40003846 + ... + 40503208.
It is an arithmetic number, because the mean of its divisors is an integer number (2521934014288).
Almost surely, 220101122003301 is an apocalyptic number.
It is an amenable number.
20101122003301 is a deficient number, since it is larger than the sum of its proper divisors (74350111003).
20101122003301 is a wasteful number, since it uses less digits than its factorization.
20101122003301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 648171.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 20101122003301 its reverse (10330022110102), we get a palindrome (30431144113403).
The spelling of 20101122003301 in words is "twenty trillion, one hundred one billion, one hundred twenty-two million, three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •