Base | Representation |
---|---|
bin | 11000010010110011… |
… | …01010011000011111 |
3 | 1020122221222221122022 |
4 | 30021121222120133 |
5 | 203202402432111 |
6 | 5554112410355 |
7 | 641131321643 |
oct | 141131523037 |
9 | 36587887568 |
10 | 13042624031 |
11 | 5593248528 |
12 | 263bb469bb |
13 | 12cb176a18 |
14 | 8ba2a2c23 |
15 | 5150712db |
hex | 30966a61f |
13042624031 has 4 divisors (see below), whose sum is σ = 13045956000. Its totient is φ = 13039292064.
The previous prime is 13042624019. The next prime is 13042624037.
13042624031 is nontrivially palindromic in base 10.
13042624031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13042624031 - 218 = 13042361887 is a prime.
It is a super-2 number, since 2×130426240312 (a number of 21 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 (13042624037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1660106 + ... + 1667943.
It is an arithmetic number, because the mean of its divisors is an integer number (3261489000).
Almost surely, 213042624031 is an apocalyptic number.
13042624031 is a deficient number, since it is larger than the sum of its proper divisors (3331969).
13042624031 is an equidigital number, since it uses as much as digits as its factorization.
13042624031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3331968.
The product of its (nonzero) digits is 3456, while the sum is 26.
The spelling of 13042624031 in words is "thirteen billion, forty-two million, six hundred twenty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •