Base | Representation |
---|---|
bin | 100101111100011100000… |
… | …0001111010000101100111 |
3 | 200110112220102121020220002 |
4 | 1023320320001322011213 |
5 | 1140420340230242021 |
6 | 15031430222331515 |
7 | 1045526212223363 |
oct | 113707001720547 |
9 | 20415812536802 |
10 | 5215030321511 |
11 | 173075572a77a |
12 | 70285b129b9b |
13 | 2baa102b78ba |
14 | 1405a1b022a3 |
15 | 909c549950b |
hex | 4be3807a167 |
5215030321511 has 4 divisors (see below), whose sum is σ = 5225738803152. Its totient is φ = 5204321839872.
The previous prime is 5215030321499. The next prime is 5215030321597. The reversal of 5215030321511 is 1151230305125.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5215030321511 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 (5215030326511) 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, 5354240090 + ... + 5354241063.
It is an arithmetic number, because the mean of its divisors is an integer number (1306434700788).
Almost surely, 25215030321511 is an apocalyptic number.
5215030321511 is a deficient number, since it is larger than the sum of its proper divisors (10708481641).
5215030321511 is a wasteful number, since it uses less digits than its factorization.
5215030321511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10708481640.
The product of its (nonzero) digits is 4500, while the sum is 29.
Adding to 5215030321511 its reverse (1151230305125), we get a palindrome (6366260626636).
The spelling of 5215030321511 in words is "five trillion, two hundred fifteen billion, thirty million, three hundred twenty-one thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •