Base | Representation |
---|---|
bin | 1001011111001100000000… |
… | …0010001110010110101001 |
3 | 1100221020021100221222210002 |
4 | 2113303000002032112221 |
5 | 2331402003003400431 |
6 | 34104041535432345 |
7 | 2124433606306331 |
oct | 227630002162651 |
9 | 40836240858702 |
10 | 10431402403241 |
11 | 3361a2978a796 |
12 | 12058136856b5 |
13 | 5a88a556c251 |
14 | 280c4dab60c1 |
15 | 1315286323cb |
hex | 97cc008e5a9 |
10431402403241 has 16 divisors (see below), whose sum is σ = 11179389312000. Its totient is φ = 9698373619968.
The previous prime is 10431402403237. The next prime is 10431402403267. The reversal of 10431402403241 is 14230420413401.
It is a cyclic number.
It is not a de Polignac number, because 10431402403241 - 22 = 10431402403237 is a prime.
It is a super-2 number, since 2×104314024032412 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10431402403231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11805560 + ... + 12658358.
It is an arithmetic number, because the mean of its divisors is an integer number (698711832000).
Almost surely, 210431402403241 is an apocalyptic number.
It is an amenable number.
10431402403241 is a deficient number, since it is larger than the sum of its proper divisors (747986908759).
10431402403241 is an equidigital number, since it uses as much as digits as its factorization.
10431402403241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 861568.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 10431402403241 its reverse (14230420413401), we get a palindrome (24661822816642).
The spelling of 10431402403241 in words is "ten trillion, four hundred thirty-one billion, four hundred two million, four hundred three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •