Base | Representation |
---|---|
bin | 1100001100100111111000… |
… | …1101010010010001001001 |
3 | 1202111002011000111120111022 |
4 | 3003021332031102101021 |
5 | 3224211214324410100 |
6 | 44304533014442225 |
7 | 2552625133162361 |
oct | 303117615222111 |
9 | 52432130446438 |
10 | 13411005310025 |
11 | 4300636967434 |
12 | 1607186663375 |
13 | 76386336000b |
14 | 34514ba7b9a1 |
15 | 183cb731ce85 |
hex | c327e352449 |
13411005310025 has 12 divisors (see below), whose sum is σ = 16632632867100. Its totient is φ = 10726877614080.
The previous prime is 13411005309991. The next prime is 13411005310057. The reversal of 13411005310025 is 52001350011431.
It can be written as a sum of positive squares in 6 ways, for example, as 1109508302224 + 12301497007801 = 1053332^2 + 3507349^2 .
It is not a de Polignac number, because 13411005310025 - 210 = 13411005309001 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13411005309976 and 13411005310003.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 48023840 + ... + 48302289.
It is an arithmetic number, because the mean of its divisors is an integer number (1386052738925).
Almost surely, 213411005310025 is an apocalyptic number.
It is an amenable number.
13411005310025 is a deficient number, since it is larger than the sum of its proper divisors (3221627557075).
13411005310025 is an equidigital number, since it uses as much as digits as its factorization.
13411005310025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 96331708 (or 96331703 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 13411005310025 its reverse (52001350011431), we get a palindrome (65412355321456).
The spelling of 13411005310025 in words is "thirteen trillion, four hundred eleven billion, five million, three hundred ten thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •