Base | Representation |
---|---|
bin | 1101101000101001111… |
… | …0101001101110111100 |
3 | 211101122101120102211100 |
4 | 3122022132221232330 |
5 | 12314221342300202 |
6 | 255340315053100 |
7 | 22631654052426 |
oct | 3321236515674 |
9 | 741571512740 |
10 | 234251525052 |
11 | 903889739a6 |
12 | 39496441190 |
13 | 1912246056c |
14 | b4a3035816 |
15 | 616045941c |
hex | 368a7a9bbc |
234251525052 has 36 divisors (see below), whose sum is σ = 592545147376. Its totient is φ = 78029861760.
The previous prime is 234251525051. The next prime is 234251525089. The reversal of 234251525052 is 250525152432.
234251525052 is a `hidden beast` number, since 2 + 3 + 42 + 515 + 2 + 50 + 52 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 234251524998 and 234251525016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (234251525051) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2196349 + ... + 2300532.
Almost surely, 2234251525052 is an apocalyptic number.
It is an amenable number.
234251525052 is an abundant number, since it is smaller than the sum of its proper divisors (358293622324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
234251525052 is a wasteful number, since it uses less digits than its factorization.
234251525052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4498338 (or 4498333 counting only the distinct ones).
The product of its (nonzero) digits is 120000, while the sum is 36.
Adding to 234251525052 its reverse (250525152432), we get a palindrome (484776677484).
The spelling of 234251525052 in words is "two hundred thirty-four billion, two hundred fifty-one million, five hundred twenty-five thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •