Base | Representation |
---|---|
bin | 1001011110110000110110… |
… | …0000000010110101001001 |
3 | 1100220112110022000210212221 |
4 | 2113230031200002311021 |
5 | 2331242040201201101 |
6 | 34100434311534041 |
7 | 2124055134105433 |
oct | 227541540026511 |
9 | 40815408023787 |
10 | 10424112131401 |
11 | 33599285a6641 |
12 | 120431a08a321 |
13 | 5a7cb3093427 |
14 | 28075b799653 |
15 | 13124d5cbaa1 |
hex | 97b0d802d49 |
10424112131401 has 32 divisors (see below), whose sum is σ = 11241365224320. Its totient is φ = 9631362318336.
The previous prime is 10424112131393. The next prime is 10424112131417. The reversal of 10424112131401 is 10413121142401.
It is not a de Polignac number, because 10424112131401 - 23 = 10424112131393 is a prime.
It is a super-2 number, since 2×104241121314012 (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 (10424112131471) 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 31 ways as a sum of consecutive naturals, for example, 119330526 + ... + 119417848.
It is an arithmetic number, because the mean of its divisors is an integer number (351292663260).
Almost surely, 210424112131401 is an apocalyptic number.
It is an amenable number.
10424112131401 is a deficient number, since it is larger than the sum of its proper divisors (817253092919).
10424112131401 is a wasteful number, since it uses less digits than its factorization.
10424112131401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87993.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 10424112131401 its reverse (10413121142401), we get a palindrome (20837233273802).
The spelling of 10424112131401 in words is "ten trillion, four hundred twenty-four billion, one hundred twelve million, one hundred thirty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •