Base | Representation |
---|---|
bin | 101110100001111… |
… | …0000011111010110 |
3 | 11000210210112111122 |
4 | 1131003300133112 |
5 | 11144141004014 |
6 | 414531203542 |
7 | 53455354211 |
oct | 13503603726 |
9 | 4023715448 |
10 | 1561266134 |
11 | 73132639a |
12 | 376a465b2 |
13 | 1bb5c361c |
14 | 10b4d0778 |
15 | 920ec58e |
hex | 5d0f07d6 |
1561266134 has 8 divisors (see below), whose sum is σ = 2405193888. Its totient is φ = 759534840.
The previous prime is 1561266131. The next prime is 1561266137. The reversal of 1561266134 is 4316621651.
It is an interprime number because it is at equal distance from previous prime (1561266131) and next prime (1561266137).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1561266094 and 1561266103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1561266131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10549022 + ... + 10549169.
It is an arithmetic number, because the mean of its divisors is an integer number (300649236).
Almost surely, 21561266134 is an apocalyptic number.
1561266134 is a deficient number, since it is larger than the sum of its proper divisors (843927754).
1561266134 is a wasteful number, since it uses less digits than its factorization.
1561266134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21098230.
The product of its digits is 25920, while the sum is 35.
The square root of 1561266134 is about 39512.8603621656. The cubic root of 1561266134 is about 1160.0916827059.
Adding to 1561266134 its reverse (4316621651), we get a palindrome (5877887785).
The spelling of 1561266134 in words is "one billion, five hundred sixty-one million, two hundred sixty-six thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •