Base | Representation |
---|---|
bin | 11000010000110011… |
… | …10110100000111111 |
3 | 1020121210112002210112 |
4 | 30020121312200333 |
5 | 203134112142021 |
6 | 5552314100235 |
7 | 640536202445 |
oct | 141031664077 |
9 | 36553462715 |
10 | 13025896511 |
11 | 5584862931 |
12 | 263641a67b |
13 | 12c786ac94 |
14 | 8b7d8ab95 |
15 | 513869d5b |
hex | 30867683f |
13025896511 has 4 divisors (see below), whose sum is σ = 13041763224. Its totient is φ = 13010029800.
The previous prime is 13025896463. The next prime is 13025896523. The reversal of 13025896511 is 11569852031.
13025896511 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11569852031 = 13093 ⋅883667.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13025896511 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 (13015896511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7932125 + ... + 7933766.
It is an arithmetic number, because the mean of its divisors is an integer number (3260440806).
Almost surely, 213025896511 is an apocalyptic number.
13025896511 is a deficient number, since it is larger than the sum of its proper divisors (15866713).
13025896511 is an equidigital number, since it uses as much as digits as its factorization.
13025896511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15866712.
The product of its (nonzero) digits is 64800, while the sum is 41.
The spelling of 13025896511 in words is "thirteen billion, twenty-five million, eight hundred ninety-six thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •