Base | Representation |
---|---|
bin | 11000110000111001… |
… | …00111011101010101 |
3 | 1021022112222212012100 |
4 | 30120130213131111 |
5 | 204212013303400 |
6 | 10035131112313 |
7 | 650315055216 |
oct | 143034473525 |
9 | 37275885170 |
10 | 13295056725 |
11 | 5702792995 |
12 | 26b05a2699 |
13 | 133b55b792 |
14 | 901a1340d |
15 | 52c2d6100 |
hex | 318727755 |
13295056725 has 36 divisors (see below), whose sum is σ = 24048736452. Its totient is φ = 7020480000.
The previous prime is 13295056721. The next prime is 13295056741. The reversal of 13295056725 is 52765059231.
13295056725 is a `hidden beast` number, since 1 + 32 + 9 + 50 + 567 + 2 + 5 = 666.
It can be written as a sum of positive squares in 6 ways, for example, as 553613841 + 12741442884 = 23529^2 + 112878^2 .
It is not a de Polignac number, because 13295056725 - 22 = 13295056721 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13295056721) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 269796 + ... + 315245.
It is an arithmetic number, because the mean of its divisors is an integer number (668020457).
Almost surely, 213295056725 is an apocalyptic number.
13295056725 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13295056725 is a deficient number, since it is larger than the sum of its proper divisors (10753679727).
13295056725 is a wasteful number, since it uses less digits than its factorization.
13295056725 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 585158 (or 585150 counting only the distinct ones).
The product of its (nonzero) digits is 567000, while the sum is 45.
The spelling of 13295056725 in words is "thirteen billion, two hundred ninety-five million, fifty-six thousand, seven hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •