Base | Representation |
---|---|
bin | 1001011110000101010011… |
… | …1001111111100111011111 |
3 | 1100212102021211000220201021 |
4 | 2113201110321333213133 |
5 | 2331044121323330211 |
6 | 34051222504425011 |
7 | 2123162414001262 |
oct | 227412471774737 |
9 | 40772254026637 |
10 | 10412425214431 |
11 | 3354980644979 |
12 | 1201bb8178167 |
13 | 5a6b6ca5a646 |
14 | 27dd6d598cd9 |
15 | 130cb75a1771 |
hex | 97854e7f9df |
10412425214431 has 8 divisors (see below), whose sum is σ = 10482386774400. Its totient is φ = 10342464714912.
The previous prime is 10412425214417. The next prime is 10412425214491. The reversal of 10412425214431 is 13441252421401.
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 10412425214431 - 29 = 10412425213919 is a prime.
It is a super-2 number, since 2×104124252144312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10412425214491) 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, 36509421 + ... + 36793513.
It is an arithmetic number, because the mean of its divisors is an integer number (1310298346800).
Almost surely, 210412425214431 is an apocalyptic number.
10412425214431 is a deficient number, since it is larger than the sum of its proper divisors (69961559969).
10412425214431 is a wasteful number, since it uses less digits than its factorization.
10412425214431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 530225.
The product of its (nonzero) digits is 30720, while the sum is 34.
Adding to 10412425214431 its reverse (13441252421401), we get a palindrome (23853677635832).
The spelling of 10412425214431 in words is "ten trillion, four hundred twelve billion, four hundred twenty-five million, two hundred fourteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •