Base | Representation |
---|---|
bin | 11011111110110… |
… | …01101010101110 |
3 | 121100200012211000 |
4 | 31333121222232 |
5 | 440042132024 |
6 | 35142541130 |
7 | 5550056400 |
oct | 1577315256 |
9 | 540605730 |
10 | 234724014 |
11 | 11054a698 |
12 | 667377a6 |
13 | 39824565 |
14 | 23260b70 |
15 | 15917cc9 |
hex | dfd9aae |
234724014 has 96 divisors (see below), whose sum is σ = 621181440. Its totient is φ = 65472624.
The previous prime is 234724013. The next prime is 234724031. The reversal of 234724014 is 410427432.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (234724013) 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 47 ways as a sum of consecutive naturals, for example, 112747 + ... + 114809.
It is an arithmetic number, because the mean of its divisors is an integer number (6470640).
Almost surely, 2234724014 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 234724014, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (310590720).
234724014 is an abundant number, since it is smaller than the sum of its proper divisors (386457426).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
234724014 is a wasteful number, since it uses less digits than its factorization.
234724014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2131 (or 2118 counting only the distinct ones).
The product of its (nonzero) digits is 5376, while the sum is 27.
The square root of 234724014 is about 15320.7054015146. The cubic root of 234724014 is about 616.8589085889.
The spelling of 234724014 in words is "two hundred thirty-four million, seven hundred twenty-four thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •