Base | Representation |
---|---|
bin | 110101001101001111000110… |
… | …111010101011111101000101 |
3 | 1010200112202111022012201220002 |
4 | 311031033012322223331011 |
5 | 221132423332324224000 |
6 | 2145404520234451045 |
7 | 100201243554054032 |
oct | 6515170672537505 |
9 | 1120482438181802 |
10 | 234006040461125 |
11 | 6861a44a3518a9 |
12 | 222b3b31593a85 |
13 | a0758a0a8acba |
14 | 41add4a652389 |
15 | 1c0c07a29e8d5 |
hex | d4d3c6eabf45 |
234006040461125 has 32 divisors (see below), whose sum is σ = 294276341893248. Its totient is φ = 185771056848000.
The previous prime is 234006040461107. The next prime is 234006040461143. The reversal of 234006040461125 is 521164040600432.
It is an interprime number because it is at equal distance from previous prime (234006040461107) and next prime (234006040461143).
It is not a de Polignac number, because 234006040461125 - 28 = 234006040460869 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 733063802 + ... + 733382948.
It is an arithmetic number, because the mean of its divisors is an integer number (9196135684164).
Almost surely, 2234006040461125 is an apocalyptic number.
234006040461125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
234006040461125 is a deficient number, since it is larger than the sum of its proper divisors (60270301432123).
234006040461125 is a wasteful number, since it uses less digits than its factorization.
234006040461125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 364070 (or 364060 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 38.
The spelling of 234006040461125 in words is "two hundred thirty-four trillion, six billion, forty million, four hundred sixty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •