Base | Representation |
---|---|
bin | 1001100110000110011011… |
… | …01100010011011110001011 |
3 | 2202201011122022001022121211 |
4 | 10303003031230103132023 |
5 | 10231201434024120243 |
6 | 112513205151113551 |
7 | 4305306566201020 |
oct | 463031554233613 |
9 | 82634568038554 |
10 | 21100330301323 |
11 | 67a5666409329 |
12 | 2449475b128b7 |
13 | ba09a2638c80 |
14 | 52d393545547 |
15 | 268d0482dd9d |
hex | 1330cdb1378b |
21100330301323 has 32 divisors (see below), whose sum is σ = 26226158206976. Its totient is φ = 16529914798848.
The previous prime is 21100330301317. The next prime is 21100330301341. The reversal of 21100330301323 is 32310303300112.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21100330301323 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21100330301294 and 21100330301303.
It is not an unprimeable number, because it can be changed into a prime (21100330301383) 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 31 ways as a sum of consecutive naturals, for example, 56736886 + ... + 57107572.
It is an arithmetic number, because the mean of its divisors is an integer number (819567443968).
Almost surely, 221100330301323 is an apocalyptic number.
21100330301323 is a deficient number, since it is larger than the sum of its proper divisors (5125827905653).
21100330301323 is a wasteful number, since it uses less digits than its factorization.
21100330301323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376883.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 21100330301323 its reverse (32310303300112), we get a palindrome (53410633601435).
The spelling of 21100330301323 in words is "twenty-one trillion, one hundred billion, three hundred thirty million, three hundred one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •