Base | Representation |
---|---|
bin | 1001011110000011101110… |
… | …0100110011101011110110 |
3 | 1100212101012012100110212010 |
4 | 2113200323210303223312 |
5 | 2331042234024331014 |
6 | 34051112403505050 |
7 | 2123146033461066 |
oct | 227407344635366 |
9 | 40771165313763 |
10 | 10412000230134 |
11 | 3354782764988 |
12 | 1201ab9988186 |
13 | 5a6b029ac049 |
14 | 27dd2cd6d3a6 |
15 | 130c90105359 |
hex | 9783b933af6 |
10412000230134 has 8 divisors (see below), whose sum is σ = 20824000460280. Its totient is φ = 3470666743376.
The previous prime is 10412000230133. The next prime is 10412000230139. The reversal of 10412000230134 is 43103200021401.
It is a sphenic number, since it is the product of 3 distinct primes.
10412000230134 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 10412000230134.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10412000230133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 867666685839 + ... + 867666685850.
It is an arithmetic number, because the mean of its divisors is an integer number (2603000057535).
Almost surely, 210412000230134 is an apocalyptic number.
10412000230134 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10412000230134 is a wasteful number, since it uses less digits than its factorization.
10412000230134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1735333371694.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 10412000230134 its reverse (43103200021401), we get a palindrome (53515200251535).
The spelling of 10412000230134 in words is "ten trillion, four hundred twelve billion, two hundred thirty thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •