Base | Representation |
---|---|
bin | 1001011110000100001101… |
… | …1001010101011011000011 |
3 | 1100212101112100020122101202 |
4 | 2113201003121111123003 |
5 | 2331043021122042243 |
6 | 34051133412051415 |
7 | 2123152215652064 |
oct | 227410331253303 |
9 | 40771470218352 |
10 | 10412131440323 |
11 | 335483a833058 |
12 | 1201b35903b6b |
13 | 5a6b23c2c602 |
14 | 27dd4256656b |
15 | 130c9b8c24b8 |
hex | 978436556c3 |
10412131440323 has 8 divisors (see below), whose sum is σ = 11025240665328. Its totient is φ = 9799092315904.
The previous prime is 10412131440311. The next prime is 10412131440341. The reversal of 10412131440323 is 32304413121401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10412131440323 is a prime.
It is a super-2 number, since 2×104121314403232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10412131445323) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17219186 + ... + 17813607.
It is an arithmetic number, because the mean of its divisors is an integer number (1378155083166).
Almost surely, 210412131440323 is an apocalyptic number.
10412131440323 is a deficient number, since it is larger than the sum of its proper divisors (613109225005).
10412131440323 is a wasteful number, since it uses less digits than its factorization.
10412131440323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35050293.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 10412131440323 its reverse (32304413121401), we get a palindrome (42716544561724).
The spelling of 10412131440323 in words is "ten trillion, four hundred twelve billion, one hundred thirty-one million, four hundred forty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •