Base | Representation |
---|---|
bin | 1001100110000101110111… |
… | …10011100101100000101011 |
3 | 2202201010212101101121220000 |
4 | 10303002323303211200223 |
5 | 10231200330214022311 |
6 | 112513115311234043 |
7 | 4305266263433226 |
oct | 463027363454053 |
9 | 82633771347800 |
10 | 21100030220331 |
11 | 67a5521a8a007 |
12 | 24493b1518923 |
13 | ba095541035a |
14 | 52d3657505bd |
15 | 268cd8306056 |
hex | 1330bbce582b |
21100030220331 has 20 divisors (see below), whose sum is σ = 32252816799192. Its totient is φ = 13739554559808.
The previous prime is 21100030220323. The next prime is 21100030220341. The reversal of 21100030220331 is 13302203000112.
21100030220331 is a `hidden beast` number, since 2 + 1 + 10 + 0 + 0 + 302 + 20 + 331 = 666.
It is not a de Polignac number, because 21100030220331 - 23 = 21100030220323 is a prime.
It is a super-2 number, since 2×211000302203312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21100030220341) 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 19 ways as a sum of consecutive naturals, for example, 3028998846 + ... + 3029005811.
Almost surely, 221100030220331 is an apocalyptic number.
21100030220331 is a deficient number, since it is larger than the sum of its proper divisors (11152786578861).
21100030220331 is an equidigital number, since it uses as much as digits as its factorization.
21100030220331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6058004712 (or 6058004703 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 21100030220331 its reverse (13302203000112), we get a palindrome (34402233220443).
The spelling of 21100030220331 in words is "twenty-one trillion, one hundred billion, thirty million, two hundred twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •