Base | Representation |
---|---|
bin | 10011100011111001… |
… | …010001011110100011 |
3 | 2000012202102202012211 |
4 | 103203321101132203 |
5 | 321003321423021 |
6 | 13352045502551 |
7 | 1342324124614 |
oct | 234371213643 |
9 | 60182382184 |
10 | 21003311011 |
11 | 89a8904481 |
12 | 40a1b71a57 |
13 | 1c99503ba7 |
14 | 1033655c0b |
15 | 82dda33e1 |
hex | 4e3e517a3 |
21003311011 has 8 divisors (see below), whose sum is σ = 22658400864. Its totient is φ = 19394843520.
The previous prime is 21003311009. The next prime is 21003311033. The reversal of 21003311011 is 11011330012.
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 21003311011 - 21 = 21003311009 is a prime.
It is a super-2 number, since 2×210033110112 (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 = 21003310982 and 21003311000.
It is not an unprimeable number, because it can be changed into a prime (21003311071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11654655 + ... + 11656456.
It is an arithmetic number, because the mean of its divisors is an integer number (2832300108).
Almost surely, 221003311011 is an apocalyptic number.
21003311011 is a deficient number, since it is larger than the sum of its proper divisors (1655089853).
21003311011 is a wasteful number, since it uses less digits than its factorization.
21003311011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23311181.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 21003311011 its reverse (11011330012), we get a palindrome (32014641023).
The spelling of 21003311011 in words is "twenty-one billion, three million, three hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •