Base | Representation |
---|---|
bin | 1100001101011101001110… |
… | …0100101010110101010011 |
3 | 1202112110002210122100212200 |
4 | 3003113103210222311103 |
5 | 3224430030013431303 |
6 | 44315301415454243 |
7 | 2553643001400552 |
oct | 303272344526523 |
9 | 52473083570780 |
10 | 13425322405203 |
11 | 43067135559a5 |
12 | 1609b01387383 |
13 | 765005573b77 |
14 | 345b092d7d99 |
15 | 1843541da3a3 |
hex | c35d392ad53 |
13425322405203 has 24 divisors (see below), whose sum is σ = 19847780292912. Its totient is φ = 8740013825088.
The previous prime is 13425322405189. The next prime is 13425322405211. The reversal of 13425322405203 is 30250422352431.
13425322405203 is a `hidden beast` number, since 1 + 3 + 4 + 25 + 3 + 22 + 405 + 203 = 666.
It is not a de Polignac number, because 13425322405203 - 26 = 13425322405139 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13425322405003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2432476 + ... + 5724297.
It is an arithmetic number, because the mean of its divisors is an integer number (826990845538).
Almost surely, 213425322405203 is an apocalyptic number.
13425322405203 is a deficient number, since it is larger than the sum of its proper divisors (6422457887709).
13425322405203 is a wasteful number, since it uses less digits than its factorization.
13425322405203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8161075 (or 8161072 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 36.
Adding to 13425322405203 its reverse (30250422352431), we get a palindrome (43675744757634).
The spelling of 13425322405203 in words is "thirteen trillion, four hundred twenty-five billion, three hundred twenty-two million, four hundred five thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •