Base | Representation |
---|---|
bin | 11001000010010110… |
… | …10110110101010101 |
3 | 1021200202121022210222 |
4 | 30201023112311111 |
5 | 210012012332000 |
6 | 10101442324125 |
7 | 654044044505 |
oct | 144113266525 |
9 | 37622538728 |
10 | 13441527125 |
11 | 5778434304 |
12 | 2731659645 |
13 | 13629c2c60 |
14 | 91725da05 |
15 | 53a0b9a85 |
hex | 3212d6d55 |
13441527125 has 64 divisors (see below), whose sum is σ = 18607942080. Its totient is φ = 9630720000.
The previous prime is 13441527053. The next prime is 13441527131. The reversal of 13441527125 is 52172514431.
13441527125 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 32 ways, for example, as 12835530436 + 605996689 = 113294^2 + 24617^2 .
It is not a de Polignac number, because 13441527125 - 28 = 13441526869 is a prime.
It is a super-2 number, since 2×134415271252 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 15256685 + ... + 15257565.
It is an arithmetic number, because the mean of its divisors is an integer number (290749095).
Almost surely, 213441527125 is an apocalyptic number.
It is an amenable number.
13441527125 is a deficient number, since it is larger than the sum of its proper divisors (5166414955).
13441527125 is a wasteful number, since it uses less digits than its factorization.
13441527125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1179 (or 1169 counting only the distinct ones).
The product of its digits is 33600, while the sum is 35.
The spelling of 13441527125 in words is "thirteen billion, four hundred forty-one million, five hundred twenty-seven thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •