Base | Representation |
---|---|
bin | 1110101100010… |
… | …11110011111101 |
3 | 22120221001112022 |
4 | 13112023303331 |
5 | 223023143221 |
6 | 20121445525 |
7 | 3024442055 |
oct | 726136375 |
9 | 276831468 |
10 | 123256061 |
11 | 63636115 |
12 | 353408a5 |
13 | 1c6c6ca6 |
14 | 12526565 |
15 | ac4a4ab |
hex | 758bcfd |
123256061 has 4 divisors (see below), whose sum is σ = 127506300. Its totient is φ = 119005824.
The previous prime is 123256033. The next prime is 123256109. The reversal of 123256061 is 160652321.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 160652321 = 179 ⋅897499.
It can be written as a sum of positive squares in 2 ways, for example, as 33120025 + 90136036 = 5755^2 + 9494^2 .
It is a cyclic number.
It is not a de Polignac number, because 123256061 - 26 = 123255997 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 123256061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123256261) 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, 2125076 + ... + 2125133.
It is an arithmetic number, because the mean of its divisors is an integer number (31876575).
Almost surely, 2123256061 is an apocalyptic number.
It is an amenable number.
123256061 is a deficient number, since it is larger than the sum of its proper divisors (4250239).
123256061 is an equidigital number, since it uses as much as digits as its factorization.
123256061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4250238.
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 123256061 is about 11102.0746259427. The cubic root of 123256061 is about 497.6638498042.
The spelling of 123256061 in words is "one hundred twenty-three million, two hundred fifty-six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •