Base | Representation |
---|---|
bin | 1110100110111… |
… | …00000101000101 |
3 | 22112120111011001 |
4 | 13103130011011 |
5 | 222332130021 |
6 | 20054213301 |
7 | 3015353401 |
oct | 723340505 |
9 | 275514131 |
10 | 122536261 |
11 | 63194341 |
12 | 35054231 |
13 | 1c504483 |
14 | 123ba101 |
15 | ab57091 |
hex | 74dc145 |
122536261 has 4 divisors (see below), whose sum is σ = 122579500. Its totient is φ = 122493024.
The previous prime is 122536247. The next prime is 122536291. The reversal of 122536261 is 162635221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 162635221 = 7 ⋅23233603.
It can be written as a sum of positive squares in 2 ways, for example, as 6220036 + 116316225 = 2494^2 + 10785^2 .
It is a cyclic number.
It is not a de Polignac number, because 122536261 - 25 = 122536229 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122536231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17046 + ... + 23143.
It is an arithmetic number, because the mean of its divisors is an integer number (30644875).
Almost surely, 2122536261 is an apocalyptic number.
It is an amenable number.
122536261 is a deficient number, since it is larger than the sum of its proper divisors (43239).
122536261 is an equidigital number, since it uses as much as digits as its factorization.
122536261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43238.
The product of its digits is 4320, while the sum is 28.
The square root of 122536261 is about 11069.6097943875. The cubic root of 122536261 is about 496.6931929338.
The spelling of 122536261 in words is "one hundred twenty-two million, five hundred thirty-six thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •