Base | Representation |
---|---|
bin | 1001101100001101000001… |
… | …10110010000000010110111 |
3 | 2210110012220201112101202121 |
4 | 10312012200312100002313 |
5 | 10243120421010102021 |
6 | 113153405424020411 |
7 | 4326412304430616 |
oct | 466064066200267 |
9 | 83405821471677 |
10 | 21310031331511 |
11 | 687659615404a |
12 | 248203a461707 |
13 | bb76b17186a0 |
14 | 5395a7ba387d |
15 | 26e4c97a7741 |
hex | 1361a0d900b7 |
21310031331511 has 8 divisors (see below), whose sum is σ = 23086685258784. Its totient is φ = 19553008939680.
The previous prime is 21310031331503. The next prime is 21310031331559. The reversal of 21310031331511 is 11513313001312.
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 21310031331511 - 23 = 21310031331503 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21310031331811) 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, 4907881600 + ... + 4907885941.
It is an arithmetic number, because the mean of its divisors is an integer number (2885835657348).
Almost surely, 221310031331511 is an apocalyptic number.
21310031331511 is a deficient number, since it is larger than the sum of its proper divisors (1776653927273).
21310031331511 is a wasteful number, since it uses less digits than its factorization.
21310031331511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9815767721.
The product of its (nonzero) digits is 810, while the sum is 25.
Adding to 21310031331511 its reverse (11513313001312), we get a palindrome (32823344332823).
The spelling of 21310031331511 in words is "twenty-one trillion, three hundred ten billion, thirty-one million, three hundred thirty-one thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •