Base | Representation |
---|---|
bin | 1001011110000011110001… |
… | …0111000011110010101011 |
3 | 1100212101020010010202001102 |
4 | 2113200330113003302223 |
5 | 2331042300412401212 |
6 | 34051113554112015 |
7 | 2123146253444615 |
oct | 227407427036253 |
9 | 40771203122042 |
10 | 10412013403307 |
11 | 335478a1420aa |
12 | 1201b0227b60b |
13 | 5a6b05642019 |
14 | 27dd309dbdb5 |
15 | 130c913585c2 |
hex | 9783c5c3cab |
10412013403307 has 2 divisors, whose sum is σ = 10412013403308. Its totient is φ = 10412013403306.
The previous prime is 10412013403291. The next prime is 10412013403349. The reversal of 10412013403307 is 70330431021401.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10412013403307 - 24 = 10412013403291 is a prime.
It is a super-2 number, since 2×104120134033072 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10412013403307.
It is not a weakly prime, because it can be changed into another prime (10412013400307) 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 as a sum of consecutive naturals, namely, 5206006701653 + 5206006701654.
It is an arithmetic number, because the mean of its divisors is an integer number (5206006701654).
Almost surely, 210412013403307 is an apocalyptic number.
10412013403307 is a deficient number, since it is larger than the sum of its proper divisors (1).
10412013403307 is an equidigital number, since it uses as much as digits as its factorization.
10412013403307 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 29.
Adding to 10412013403307 its reverse (70330431021401), we get a palindrome (80742444424708).
The spelling of 10412013403307 in words is "ten trillion, four hundred twelve billion, thirteen million, four hundred three thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.203 sec. • engine limits •