Base | Representation |
---|---|
bin | 11100000000001… |
… | …10000000000000 |
3 | 121101000102220102 |
4 | 32000012000000 |
5 | 440113434400 |
6 | 35150501532 |
7 | 5551443656 |
oct | 1600060000 |
9 | 541012812 |
10 | 234905600 |
11 | 110664066 |
12 | 668048a8 |
13 | 398890c7 |
14 | 232aadd6 |
15 | 159519d5 |
hex | e006000 |
234905600 has 168 divisors, whose sum is σ = 617573568. Its totient is φ = 88473600.
The previous prime is 234905591. The next prime is 234905633. The reversal of 234905600 is 6509432.
It is a super-2 number, since 2×2349056002 = 110361281822720000, which contains 22 as substring.
It is a zygodrome in base 2.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6348782 + ... + 6348818.
Almost surely, 2234905600 is an apocalyptic number.
234905600 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 234905600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (308786784).
234905600 is an abundant number, since it is smaller than the sum of its proper divisors (382667968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
234905600 is an equidigital number, since it uses as much as digits as its factorization.
234905600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104 (or 75 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 29.
The square root of 234905600 is about 15326.6304189799. The cubic root of 234905600 is about 617.0179380057.
The spelling of 234905600 in words is "two hundred thirty-four million, nine hundred five thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •