Base | Representation |
---|---|
bin | 10011101001101011… |
… | …011011000000100011 |
3 | 2000110112000111112110 |
4 | 103221223123000203 |
5 | 321203141441311 |
6 | 13405433330403 |
7 | 1344612646644 |
oct | 235153330043 |
9 | 60415014473 |
10 | 21100343331 |
11 | 8a48659281 |
12 | 410a566a03 |
13 | 1cb3648972 |
14 | 10424b36cb |
15 | 83766d8a6 |
hex | 4e9adb023 |
21100343331 has 8 divisors (see below), whose sum is σ = 28137488400. Its totient is φ = 14065046912.
The previous prime is 21100343281. The next prime is 21100343351. The reversal of 21100343331 is 13334300112.
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 21100343331 - 227 = 20966125603 is a prime.
It is a super-2 number, since 2×211003433312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21100343298 and 21100343307.
It is not an unprimeable number, because it can be changed into a prime (21100343351) 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, 435306 + ... + 481343.
It is an arithmetic number, because the mean of its divisors is an integer number (3517186050).
Almost surely, 221100343331 is an apocalyptic number.
21100343331 is a deficient number, since it is larger than the sum of its proper divisors (7037145069).
21100343331 is an equidigital number, since it uses as much as digits as its factorization.
21100343331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 924325.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 21100343331 its reverse (13334300112), we get a palindrome (34434643443).
The spelling of 21100343331 in words is "twenty-one billion, one hundred million, three hundred forty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •