Base | Representation |
---|---|
bin | 10011101111100111… |
… | …111110011001100011 |
3 | 2000201110201211002102 |
4 | 103233213332121203 |
5 | 321404211244021 |
6 | 13423355441015 |
7 | 1350233621333 |
oct | 235747763143 |
9 | 60643654072 |
10 | 21200103011 |
11 | 8a999a619a |
12 | 4137a5616b |
13 | 1ccb206c69 |
14 | 10518410c3 |
15 | 8412c700b |
hex | 4ef9fe663 |
21200103011 has 8 divisors (see below), whose sum is σ = 22678583760. Its totient is φ = 19747335168.
The previous prime is 21200102981. The next prime is 21200103037. The reversal of 21200103011 is 11030100212.
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 21200103011 - 26 = 21200102947 is a prime.
It is a super-2 number, since 2×212001030112 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21200102983 and 21200103001.
It is not an unprimeable number, because it can be changed into a prime (21200103511) 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, 6426521 + ... + 6429818.
It is an arithmetic number, because the mean of its divisors is an integer number (2834822970).
Almost surely, 221200103011 is an apocalyptic number.
21200103011 is a deficient number, since it is larger than the sum of its proper divisors (1478480749).
21200103011 is a wasteful number, since it uses less digits than its factorization.
21200103011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12856453.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 21200103011 its reverse (11030100212), we get a palindrome (32230203223).
The spelling of 21200103011 in words is "twenty-one billion, two hundred million, one hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •