Base | Representation |
---|---|
bin | 1011110101010011010101… |
… | …0011000100110000000001 |
3 | 1201001202222200002201112001 |
4 | 2331110311103010300001 |
5 | 3201130144113212400 |
6 | 43400512231504001 |
7 | 2511652414311115 |
oct | 275246523046001 |
9 | 51052880081461 |
10 | 13010350132225 |
11 | 416672751a286 |
12 | 15615abb28001 |
13 | 734b42077004 |
14 | 32d9c088b745 |
15 | 178668157a6a |
hex | bd5354c4c01 |
13010350132225 has 6 divisors (see below), whose sum is σ = 16132834163990. Its totient is φ = 10408280105760.
The previous prime is 13010350132187. The next prime is 13010350132253. The reversal of 13010350132225 is 52223105301031.
It can be written as a sum of positive squares in 3 ways, for example, as 172410970176 + 12837939162049 = 415224^2 + 3583007^2 .
It is not a de Polignac number, because 13010350132225 - 27 = 13010350132097 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13010350132193 and 13010350132202.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 260207002620 + ... + 260207002669.
Almost surely, 213010350132225 is an apocalyptic number.
It is an amenable number.
13010350132225 is a deficient number, since it is larger than the sum of its proper divisors (3122484031765).
13010350132225 is an equidigital number, since it uses as much as digits as its factorization.
13010350132225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 520414005299 (or 520414005294 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 28.
Adding to 13010350132225 its reverse (52223105301031), we get a palindrome (65233455433256).
The spelling of 13010350132225 in words is "thirteen trillion, ten billion, three hundred fifty million, one hundred thirty-two thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •