Base | Representation |
---|---|
bin | 1001011110110010101101… |
… | …1001000111111111101111 |
3 | 1100220120202020200210011102 |
4 | 2113230223121013333233 |
5 | 2331244102042242111 |
6 | 34101000144513315 |
7 | 2124103433601302 |
oct | 227545331077757 |
9 | 40816666623142 |
10 | 10424613634031 |
11 | 335a065699a23 |
12 | 120443a01b83b |
13 | 5a8062c5344c |
14 | 2807a8222b39 |
15 | 13127c64013b |
hex | 97b2b647fef |
10424613634031 has 8 divisors (see below), whose sum is σ = 10442081408304. Its totient is φ = 10407149614080.
The previous prime is 10424613634013. The next prime is 10424613634051. The reversal of 10424613634031 is 13043631642401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10424613634031 is a prime.
It is a super-2 number, since 2×104246136340312 (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 (10424613634051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4647281 + ... + 6515093.
It is an arithmetic number, because the mean of its divisors is an integer number (1305260176038).
Almost surely, 210424613634031 is an apocalyptic number.
10424613634031 is a deficient number, since it is larger than the sum of its proper divisors (17467774273).
10424613634031 is an equidigital number, since it uses as much as digits as its factorization.
10424613634031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1877161.
The product of its (nonzero) digits is 124416, while the sum is 38.
The spelling of 10424613634031 in words is "ten trillion, four hundred twenty-four billion, six hundred thirteen million, six hundred thirty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •