Base | Representation |
---|---|
bin | 1001100011001111100001… |
… | …00000010011110111110101 |
3 | 2202100210011120001211110102 |
4 | 10301213300200103313311 |
5 | 10223044330302040424 |
6 | 112400125000203445 |
7 | 4265232235310645 |
oct | 461476040236765 |
9 | 82323146054412 |
10 | 21002130111989 |
11 | 6767a53a18664 |
12 | 243242aa69585 |
13 | b94652981370 |
14 | 52871954c525 |
15 | 2664a86117ae |
hex | 1319f0813df5 |
21002130111989 has 48 divisors (see below), whose sum is σ = 23044607611200. Its totient is φ = 19027197665280.
The previous prime is 21002130111913. The next prime is 21002130112013. The reversal of 21002130111989 is 98911103120012.
It is not a de Polignac number, because 21002130111989 - 224 = 21002113334773 is a prime.
It is a super-2 number, since 2×210021301119892 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21002133111989) 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 47 ways as a sum of consecutive naturals, for example, 16268109434 + ... + 16268110724.
It is an arithmetic number, because the mean of its divisors is an integer number (480095991900).
Almost surely, 221002130111989 is an apocalyptic number.
It is an amenable number.
21002130111989 is a deficient number, since it is larger than the sum of its proper divisors (2042477499211).
21002130111989 is a wasteful number, since it uses less digits than its factorization.
21002130111989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2422 (or 2349 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 38.
The spelling of 21002130111989 in words is "twenty-one trillion, two billion, one hundred thirty million, one hundred eleven thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •