Base | Representation |
---|---|
bin | 1110110011110… |
… | …00110000000001 |
3 | 22122202100210202 |
4 | 13121320300001 |
5 | 223300222221 |
6 | 20154334545 |
7 | 3035623364 |
oct | 731706001 |
9 | 278670722 |
10 | 124226561 |
11 | 64139288 |
12 | 3572a455 |
13 | 1c976954 |
14 | 126da0db |
15 | ad8cd0b |
hex | 7678c01 |
124226561 has 4 divisors (see below), whose sum is σ = 126263124. Its totient is φ = 122190000.
The previous prime is 124226551. The next prime is 124226569. The reversal of 124226561 is 165622421.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 165622421 = 181 ⋅915041.
It can be written as a sum of positive squares in 2 ways, for example, as 68574961 + 55651600 = 8281^2 + 7460^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-124226561 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (124226569) 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, 1018190 + ... + 1018311.
It is an arithmetic number, because the mean of its divisors is an integer number (31565781).
Almost surely, 2124226561 is an apocalyptic number.
It is an amenable number.
124226561 is a deficient number, since it is larger than the sum of its proper divisors (2036563).
124226561 is an equidigital number, since it uses as much as digits as its factorization.
124226561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2036562.
The product of its digits is 5760, while the sum is 29.
The square root of 124226561 is about 11145.6969723746. The cubic root of 124226561 is about 498.9666136969.
Adding to 124226561 its reverse (165622421), we get a palindrome (289848982).
The spelling of 124226561 in words is "one hundred twenty-four million, two hundred twenty-six thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •