Base | Representation |
---|---|
bin | 1100001101011101101000… |
… | …0000000010111111011100 |
3 | 1202112110101022120012201211 |
4 | 3003113122000002333130 |
5 | 3224430240120322330 |
6 | 44315320231114204 |
7 | 2553645451125361 |
oct | 303273200027734 |
9 | 52473338505654 |
10 | 13425430245340 |
11 | 4306769411883 |
12 | 1609b31512964 |
13 | 765021a010b9 |
14 | 345b1976a468 |
15 | 18435d8dcd2a |
hex | c35da002fdc |
13425430245340 has 24 divisors (see below), whose sum is σ = 29677266858960. Its totient is φ = 5087531461248.
The previous prime is 13425430245323. The next prime is 13425430245379. The reversal of 13425430245340 is 4354203452431.
It is a junction number, because it is equal to n+sod(n) for n = 13425430245293 and 13425430245302.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17665039417 + ... + 17665040176.
It is an arithmetic number, because the mean of its divisors is an integer number (1236552785790).
Almost surely, 213425430245340 is an apocalyptic number.
13425430245340 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13425430245340 is an abundant number, since it is smaller than the sum of its proper divisors (16251836613620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13425430245340 is a wasteful number, since it uses less digits than its factorization.
13425430245340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35330079621 (or 35330079619 counting only the distinct ones).
The product of its (nonzero) digits is 691200, while the sum is 40.
Adding to 13425430245340 its reverse (4354203452431), we get a palindrome (17779633697771).
The spelling of 13425430245340 in words is "thirteen trillion, four hundred twenty-five billion, four hundred thirty million, two hundred forty-five thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •