Base | Representation |
---|---|
bin | 1001101100100000011100… |
… | …11110100000011011011001 |
3 | 2210111012211112220212002111 |
4 | 10312100032132200123121 |
5 | 10243303300344114023 |
6 | 113202252342032321 |
7 | 4330231613256316 |
oct | 466201636403331 |
9 | 83435745825074 |
10 | 21320460535513 |
11 | 687aa58170407 |
12 | 248406b1186a1 |
13 | bb8684301009 |
14 | 539cb6d2dd0d |
15 | 26e8da19700d |
hex | 13640e7a06d9 |
21320460535513 has 4 divisors (see below), whose sum is σ = 21321712708560. Its totient is φ = 21319208362468.
The previous prime is 21320460535469. The next prime is 21320460535519. The reversal of 21320460535513 is 31553506402312.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21320460535513 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21320460535519) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 626060983 + ... + 626095036.
It is an arithmetic number, because the mean of its divisors is an integer number (5330428177140).
Almost surely, 221320460535513 is an apocalyptic number.
It is an amenable number.
21320460535513 is a deficient number, since it is larger than the sum of its proper divisors (1252173047).
21320460535513 is a wasteful number, since it uses less digits than its factorization.
21320460535513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1252173046.
The product of its (nonzero) digits is 324000, while the sum is 40.
Adding to 21320460535513 its reverse (31553506402312), we get a palindrome (52873966937825).
The spelling of 21320460535513 in words is "twenty-one trillion, three hundred twenty billion, four hundred sixty million, five hundred thirty-five thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •