Base | Representation |
---|---|
bin | 11001000000010100… |
… | …01011101100010101 |
3 | 1021122120110022121111 |
4 | 30200022023230111 |
5 | 204443124122013 |
6 | 10100032215021 |
7 | 653445606154 |
oct | 144012135425 |
9 | 37576408544 |
10 | 13424442133 |
11 | 5769825083 |
12 | 272799a471 |
13 | 135c2c05ab |
14 | 914c9359b |
15 | 53884273d |
hex | 32028bb15 |
13424442133 has 4 divisors (see below), whose sum is σ = 13677733548. Its totient is φ = 13171150720.
The previous prime is 13424442049. The next prime is 13424442197. The reversal of 13424442133 is 33124442431.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7502677924 + 5921764209 = 86618^2 + 76953^2 .
It is a cyclic number.
It is not a de Polignac number, because 13424442133 - 213 = 13424433941 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13424442095 and 13424442104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13424442433) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 126645628 + ... + 126645733.
It is an arithmetic number, because the mean of its divisors is an integer number (3419433387).
Almost surely, 213424442133 is an apocalyptic number.
It is an amenable number.
13424442133 is a deficient number, since it is larger than the sum of its proper divisors (253291415).
13424442133 is an equidigital number, since it uses as much as digits as its factorization.
13424442133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 253291414.
The product of its digits is 27648, while the sum is 31.
Adding to 13424442133 its reverse (33124442431), we get a palindrome (46548884564).
The spelling of 13424442133 in words is "thirteen billion, four hundred twenty-four million, four hundred forty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •