Base | Representation |
---|---|
bin | 11000110011001011… |
… | …10110100010110001 |
3 | 1021100220010020022111 |
4 | 30121211312202301 |
5 | 204231422130100 |
6 | 10041054405321 |
7 | 650640205021 |
oct | 143145664261 |
9 | 37326106274 |
10 | 13314255025 |
11 | 5712605955 |
12 | 26b6b00841 |
13 | 1342521016 |
14 | 9043ada81 |
15 | 52dd296ba |
hex | 3199768b1 |
13314255025 has 6 divisors (see below), whose sum is σ = 16509676262. Its totient is φ = 10651404000.
The previous prime is 13314255011. The next prime is 13314255029. The reversal of 13314255025 is 52055241331.
13314255025 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 4126649121 + 9187605904 = 64239^2 + 95852^2 .
It is not a de Polignac number, because 13314255025 - 219 = 13313730737 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13314255029) 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 5 ways as a sum of consecutive naturals, for example, 266285076 + ... + 266285125.
Almost surely, 213314255025 is an apocalyptic number.
It is an amenable number.
13314255025 is a deficient number, since it is larger than the sum of its proper divisors (3195421237).
13314255025 is an equidigital number, since it uses as much as digits as its factorization.
13314255025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 532570211 (or 532570206 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 31.
Adding to 13314255025 its reverse (52055241331), we get a palindrome (65369496356).
The spelling of 13314255025 in words is "thirteen billion, three hundred fourteen million, two hundred fifty-five thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •