Base | Representation |
---|---|
bin | 1001000110000101110001… |
… | …1001010101110111101101 |
3 | 1022102000100111120022010201 |
4 | 2101201130121111313231 |
5 | 2302320434401342031 |
6 | 33134013304433501 |
7 | 2051331056410402 |
oct | 221413431256755 |
9 | 38360314508121 |
10 | 10000234012141 |
11 | 320609143788a |
12 | 1156142178891 |
13 | 577030790a49 |
14 | 26802a2462a9 |
15 | 1251e0769d61 |
hex | 9185c655ded |
10000234012141 has 8 divisors (see below), whose sum is σ = 10005295997664. Its totient is φ = 9995172569040.
The previous prime is 10000234012133. The next prime is 10000234012147. The reversal of 10000234012141 is 14121043200001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10000234012141 - 23 = 10000234012133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10000234012147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39680911 + ... + 39932131.
It is an arithmetic number, because the mean of its divisors is an integer number (1250661999708).
Almost surely, 210000234012141 is an apocalyptic number.
It is an amenable number.
10000234012141 is a deficient number, since it is larger than the sum of its proper divisors (5061985523).
10000234012141 is a wasteful number, since it uses less digits than its factorization.
10000234012141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271211.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 10000234012141 its reverse (14121043200001), we get a palindrome (24121277212142).
The spelling of 10000234012141 in words is "ten trillion, two hundred thirty-four million, twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •