Base | Representation |
---|---|
bin | 1001100011100000101010… |
… | …00011010011110110101001 |
3 | 2202101122220221022012122212 |
4 | 10301300111003103312221 |
5 | 10223222202244420241 |
6 | 112404250114254505 |
7 | 4266006265264121 |
oct | 461602503236651 |
9 | 82348827265585 |
10 | 21011333201321 |
11 | 6770946911911 |
12 | 2434178b87435 |
13 | b9548b52ab58 |
14 | 528d4d90bc81 |
15 | 266846557beb |
hex | 131c150d3da9 |
21011333201321 has 8 divisors (see below), whose sum is σ = 21353454541440. Its totient is φ = 20671330260112.
The previous prime is 21011333201297. The next prime is 21011333201393. The reversal of 21011333201321 is 12310233311012.
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 21011333201321 - 222 = 21011329007017 is a prime.
It is a super-2 number, since 2×210113332013212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21011333206321) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 529579730 + ... + 529619403.
It is an arithmetic number, because the mean of its divisors is an integer number (2669181817680).
Almost surely, 221011333201321 is an apocalyptic number.
It is an amenable number.
21011333201321 is a deficient number, since it is larger than the sum of its proper divisors (342121340119).
21011333201321 is a wasteful number, since it uses less digits than its factorization.
21011333201321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1059199455.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 21011333201321 its reverse (12310233311012), we get a palindrome (33321566512333).
The spelling of 21011333201321 in words is "twenty-one trillion, eleven billion, three hundred thirty-three million, two hundred one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •