Base | Representation |
---|---|
bin | 1001100011110001000011… |
… | …00000011111101001111011 |
3 | 2202102111122011000020101022 |
4 | 10301320201200133221323 |
5 | 10223343212310104034 |
6 | 112412303153413055 |
7 | 4266440316635654 |
oct | 461704140375173 |
9 | 82374564006338 |
10 | 21020132113019 |
11 | 6774651647466 |
12 | 2435a1386a18b |
13 | b96261432690 |
14 | 52954633a52b |
15 | 266badc62b2e |
hex | 131e2181fa7b |
21020132113019 has 8 divisors (see below), whose sum is σ = 22638746968992. Its totient is φ = 19401757488000.
The previous prime is 21020132112943. The next prime is 21020132113051. The reversal of 21020132113019 is 91031123102012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21020132113019 is a prime.
It is a super-2 number, since 2×210201321130192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21020132113069) 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, 59875982 + ... + 60226019.
It is an arithmetic number, because the mean of its divisors is an integer number (2829843371124).
Almost surely, 221020132113019 is an apocalyptic number.
21020132113019 is a deficient number, since it is larger than the sum of its proper divisors (1618614855973).
21020132113019 is a wasteful number, since it uses less digits than its factorization.
21020132113019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120115477.
The product of its (nonzero) digits is 648, while the sum is 26.
The spelling of 21020132113019 in words is "twenty-one trillion, twenty billion, one hundred thirty-two million, one hundred thirteen thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •