Base | Representation |
---|---|
bin | 11011111111000… |
… | …01111111101000 |
3 | 121100201221121012 |
4 | 31333201333220 |
5 | 440044224440 |
6 | 35143403052 |
7 | 5550261002 |
oct | 1577417750 |
9 | 540657535 |
10 | 234758120 |
11 | 110573283 |
12 | 66753488 |
13 | 39836c3c |
14 | 2326d372 |
15 | 15922e65 |
hex | dfe1fe8 |
234758120 has 16 divisors (see below), whose sum is σ = 528205860. Its totient is φ = 93903232.
The previous prime is 234758101. The next prime is 234758123. The reversal of 234758120 is 21857432.
It can be written as a sum of positive squares in 2 ways, for example, as 234028804 + 729316 = 15298^2 + 854^2 .
It is a super-2 number, since 2×2347581202 = 110222749811868800, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (234758123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2934437 + ... + 2934516.
Almost surely, 2234758120 is an apocalyptic number.
234758120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
234758120 is an abundant number, since it is smaller than the sum of its proper divisors (293447740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
234758120 is a wasteful number, since it uses less digits than its factorization.
234758120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5868964 (or 5868960 counting only the distinct ones).
The product of its (nonzero) digits is 13440, while the sum is 32.
The square root of 234758120 is about 15321.8184299384. The cubic root of 234758120 is about 616.8887842013. Note that the first 3 decimals are identical.
The spelling of 234758120 in words is "two hundred thirty-four million, seven hundred fifty-eight thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •