Base | Representation |
---|---|
bin | 1110101011011… |
… | …01100001111011 |
3 | 22120200202101110 |
4 | 13111231201323 |
5 | 223010211102 |
6 | 20115051403 |
7 | 3023414334 |
oct | 725554173 |
9 | 276622343 |
10 | 123132027 |
11 | 63560a07 |
12 | 352a0b63 |
13 | 1c6826b5 |
14 | 124d328b |
15 | ac2386c |
hex | 756d87b |
123132027 has 8 divisors (see below), whose sum is σ = 172816960. Its totient is φ = 77767560.
The previous prime is 123132019. The next prime is 123132047. The reversal of 123132027 is 720231321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 123132027 - 23 = 123132019 is a prime.
It is a super-2 number, since 2×1231320272 = 30322992146257458, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 123131994 and 123132012.
It is not an unprimeable number, because it can be changed into a prime (123132017) 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 7 ways as a sum of consecutive naturals, for example, 1080049 + ... + 1080162.
It is an arithmetic number, because the mean of its divisors is an integer number (21602120).
Almost surely, 2123132027 is an apocalyptic number.
123132027 is a deficient number, since it is larger than the sum of its proper divisors (49684933).
123132027 is a wasteful number, since it uses less digits than its factorization.
123132027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2160233.
The product of its (nonzero) digits is 504, while the sum is 21.
The square root of 123132027 is about 11096.4871468407. The cubic root of 123132027 is about 497.4968588137.
Adding to 123132027 its reverse (720231321), we get a palindrome (843363348).
The spelling of 123132027 in words is "one hundred twenty-three million, one hundred thirty-two thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •