Base | Representation |
---|---|
bin | 1001100011100000101000… |
… | …10001110011000110100001 |
3 | 2202101122220000212210112110 |
4 | 10301300110101303012201 |
5 | 10223222140434101423 |
6 | 112404244532145533 |
7 | 4266006050045634 |
oct | 461602421630641 |
9 | 82348800783473 |
10 | 21011320222113 |
11 | 677093a5573a1 |
12 | 24341747682a9 |
13 | b95488935250 |
14 | 528d4bccdc1b |
15 | 266845342193 |
hex | 131c144731a1 |
21011320222113 has 128 divisors (see below), whose sum is σ = 32172123045888. Its totient is φ = 12100133320704.
The previous prime is 21011320222049. The next prime is 21011320222117. The reversal of 21011320222113 is 31122202311012.
It is not a de Polignac number, because 21011320222113 - 26 = 21011320222049 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21011320222113.
It is not an unprimeable number, because it can be changed into a prime (21011320222117) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 3658593720 + ... + 3658599462.
It is an arithmetic number, because the mean of its divisors is an integer number (251344711296).
Almost surely, 221011320222113 is an apocalyptic number.
21011320222113 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
21011320222113 is a deficient number, since it is larger than the sum of its proper divisors (11160802823775).
21011320222113 is a wasteful number, since it uses less digits than its factorization.
21011320222113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6335.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 21011320222113 its reverse (31122202311012), we get a palindrome (52133522533125).
The spelling of 21011320222113 in words is "twenty-one trillion, eleven billion, three hundred twenty million, two hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •