Base | Representation |
---|---|
bin | 10011100011101101… |
… | …110011000110100011 |
3 | 2000012112202221000102 |
4 | 103203231303012203 |
5 | 321002034144021 |
6 | 13351501213015 |
7 | 1342256426132 |
oct | 234355630643 |
9 | 60175687012 |
10 | 21000303011 |
11 | 89a713a526 |
12 | 40a0b6116b |
13 | 1c989bc9cc |
14 | 10330b1919 |
15 | 82d9ac00b |
hex | 4e3b731a3 |
21000303011 has 8 divisors (see below), whose sum is σ = 21250635744. Its totient is φ = 20750863680.
The previous prime is 21000303007. The next prime is 21000303041. The reversal of 21000303011 is 11030300012.
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 21000303011 - 22 = 21000303007 is a prime.
It is a super-2 number, since 2×210003030112 (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 = 21000302983 and 21000303001.
It is not an unprimeable number, because it can be changed into a prime (21000303041) 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, 176000 + ... + 270141.
It is an arithmetic number, because the mean of its divisors is an integer number (2656329468).
Almost surely, 221000303011 is an apocalyptic number.
21000303011 is a deficient number, since it is larger than the sum of its proper divisors (250332733).
21000303011 is a wasteful number, since it uses less digits than its factorization.
21000303011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 446701.
The product of its (nonzero) digits is 18, while the sum is 11.
Adding to 21000303011 its reverse (11030300012), we get a palindrome (32030603023).
The spelling of 21000303011 in words is "twenty-one billion, three hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •