Base | Representation |
---|---|
bin | 1110101100001… |
… | …11111111110000 |
3 | 22120220021002110 |
4 | 13112013333300 |
5 | 223022143212 |
6 | 20121245320 |
7 | 3024345360 |
oct | 726077760 |
9 | 276807073 |
10 | 123240432 |
11 | 636253a7 |
12 | 35333840 |
13 | 1c6bcb43 |
14 | 125209a0 |
15 | ac45a3c |
hex | 7587ff0 |
123240432 has 40 divisors (see below), whose sum is σ = 363853696. Its totient is φ = 35211456.
The previous prime is 123240431. The next prime is 123240437. The reversal of 123240432 is 234042321.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 123240399 and 123240408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123240431) 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, 183058 + ... + 183729.
Almost surely, 2123240432 is an apocalyptic number.
123240432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
123240432 is an abundant number, since it is smaller than the sum of its proper divisors (240613264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123240432 is a wasteful number, since it uses less digits than its factorization.
123240432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 366805 (or 366799 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 21.
The square root of 123240432 is about 11101.3707261761. The cubic root of 123240432 is about 497.6428141461.
Adding to 123240432 its reverse (234042321), we get a palindrome (357282753).
The spelling of 123240432 in words is "one hundred twenty-three million, two hundred forty thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •