Base | Representation |
---|---|
bin | 10100000010001011… |
… | …000110100110001001 |
3 | 2001112011022100011212 |
4 | 110002023012212021 |
5 | 323023343122023 |
6 | 13514313502505 |
7 | 1361033021522 |
oct | 240213064611 |
9 | 61464270155 |
10 | 21511301513 |
11 | 9139629239 |
12 | 4204111a35 |
13 | 204a825ca0 |
14 | 1080ccb849 |
15 | 85d798e78 |
hex | 5022c6989 |
21511301513 has 8 divisors (see below), whose sum is σ = 23426310600. Its totient is φ = 19633477248.
The previous prime is 21511301491. The next prime is 21511301519. The reversal of 21511301513 is 31510311512.
It can be written as a sum of positive squares in 4 ways, for example, as 594043129 + 20917258384 = 24373^2 + 144628^2 .
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 21511301513 - 232 = 17216334217 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21511301519) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9294998 + ... + 9297311.
It is an arithmetic number, because the mean of its divisors is an integer number (2928288825).
Almost surely, 221511301513 is an apocalyptic number.
It is an amenable number.
21511301513 is a deficient number, since it is larger than the sum of its proper divisors (1915009087).
21511301513 is a wasteful number, since it uses less digits than its factorization.
21511301513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18592411.
The product of its (nonzero) digits is 450, while the sum is 23.
Subtracting 21511301513 from its reverse (31510311512), we obtain a palindrome (9999009999).
The spelling of 21511301513 in words is "twenty-one billion, five hundred eleven million, three hundred one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •