Base | Representation |
---|---|
bin | 11000101000010001… |
… | …10000101000001001 |
3 | 1021010111220220210002 |
4 | 30110020300220021 |
5 | 204040010230122 |
6 | 10024025132345 |
7 | 645446312534 |
oct | 142410605011 |
9 | 37114826702 |
10 | 13222742537 |
11 | 56759911a4 |
12 | 269032a0b5 |
13 | 132958c814 |
14 | 8d618ba1b |
15 | 525c9e992 |
hex | 314230a09 |
13222742537 has 4 divisors (see below), whose sum is σ = 13223042196. Its totient is φ = 13222442880.
The previous prime is 13222742521. The next prime is 13222742539. The reversal of 13222742537 is 73524722231.
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 140873161 + 13081869376 = 11869^2 + 114376^2 .
It is a cyclic number.
It is not a de Polignac number, because 13222742537 - 24 = 13222742521 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13222742537.
It is not an unprimeable number, because it can be changed into a prime (13222742539) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 69164 + ... + 176717.
It is an arithmetic number, because the mean of its divisors is an integer number (3305760549).
Almost surely, 213222742537 is an apocalyptic number.
It is an amenable number.
13222742537 is a deficient number, since it is larger than the sum of its proper divisors (299659).
13222742537 is an equidigital number, since it uses as much as digits as its factorization.
13222742537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 299658.
The product of its digits is 141120, while the sum is 38.
The spelling of 13222742537 in words is "thirteen billion, two hundred twenty-two million, seven hundred forty-two thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •