Base | Representation |
---|---|
bin | 1001011110000100111101… |
… | …0111001011110000100011 |
3 | 1100212102001100000110002001 |
4 | 2113201033113023300203 |
5 | 2331043424020444133 |
6 | 34051205343104431 |
7 | 2123160204264121 |
oct | 227411727136043 |
9 | 40772040013061 |
10 | 10412332203043 |
11 | 3354933097061 |
12 | 1201b90ba2117 |
13 | 5a6b566c2b14 |
14 | 27dd610a6911 |
15 | 130cae32c87d |
hex | 9784f5cbc23 |
10412332203043 has 8 divisors (see below), whose sum is σ = 10631020038912. Its totient is φ = 10195505540616.
The previous prime is 10412332203041. The next prime is 10412332203067. The reversal of 10412332203043 is 34030223321401.
It is a happy number.
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 10412332203043 - 21 = 10412332203041 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10412332203041) 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, 465282055 + ... + 465304432.
It is an arithmetic number, because the mean of its divisors is an integer number (1328877504864).
Almost surely, 210412332203043 is an apocalyptic number.
10412332203043 is a deficient number, since it is larger than the sum of its proper divisors (218687835869).
10412332203043 is an equidigital number, since it uses as much as digits as its factorization.
10412332203043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 930586721.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 10412332203043 its reverse (34030223321401), we get a palindrome (44442555524444).
The spelling of 10412332203043 in words is "ten trillion, four hundred twelve billion, three hundred thirty-two million, two hundred three thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •