Base | Representation |
---|---|
bin | 11011111001110… |
… | …01000011010100 |
3 | 121022102210101000 |
4 | 31330321003110 |
5 | 434410104012 |
6 | 35120503300 |
7 | 5541346356 |
oct | 1574710324 |
9 | 538383330 |
10 | 234066132 |
11 | 110140393 |
12 | 6647ab30 |
13 | 39653c91 |
14 | 2312d0d6 |
15 | 15837ddc |
hex | df390d4 |
234066132 has 48 divisors (see below), whose sum is σ = 642539520. Its totient is φ = 73431936.
The previous prime is 234066127. The next prime is 234066137. The reversal of 234066132 is 231660432.
234066132 is a `hidden beast` number, since 2 + 3 + 40 + 6 + 613 + 2 = 666.
It is an interprime number because it is at equal distance from previous prime (234066127) and next prime (234066137).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 234066096 and 234066105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (234066137) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 61908 + ... + 65579.
It is an arithmetic number, because the mean of its divisors is an integer number (13386240).
Almost surely, 2234066132 is an apocalyptic number.
It is an amenable number.
234066132 is an abundant number, since it is smaller than the sum of its proper divisors (408473388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
234066132 is a wasteful number, since it uses less digits than its factorization.
234066132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127517 (or 127509 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
The square root of 234066132 is about 15299.2199801166. The cubic root of 234066132 is about 616.2820607693.
The spelling of 234066132 in words is "two hundred thirty-four million, sixty-six thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •