Base | Representation |
---|---|
bin | 1110101010110… |
… | …10000001110001 |
3 | 22120112200210212 |
4 | 13111122001301 |
5 | 223000132040 |
6 | 20113233505 |
7 | 3022632416 |
oct | 725320161 |
9 | 276480725 |
10 | 123052145 |
11 | 63506997 |
12 | 35262895 |
13 | 1c655228 |
14 | 124b210d |
15 | ac09d65 |
hex | 755a071 |
123052145 has 8 divisors (see below), whose sum is σ = 147790656. Its totient is φ = 98356336.
The previous prime is 123052117. The next prime is 123052147. The reversal of 123052145 is 541250321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 123052145 - 28 = 123051889 is a prime.
It is an alternating number because its digits alternate between odd and even.
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 123052145.
It is not an unprimeable number, because it can be changed into a prime (123052147) 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 7 ways as a sum of consecutive naturals, for example, 3947 + ... + 16176.
It is an arithmetic number, because the mean of its divisors is an integer number (18473832).
Almost surely, 2123052145 is an apocalyptic number.
It is an amenable number.
123052145 is a deficient number, since it is larger than the sum of its proper divisors (24738511).
123052145 is a wasteful number, since it uses less digits than its factorization.
123052145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21351.
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 123052145 is about 11092.8871354576. The cubic root of 123052145 is about 497.3892517133.
The spelling of 123052145 in words is "one hundred twenty-three million, fifty-two thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •