Base | Representation |
---|---|
bin | 10011011010101001… |
… | …10101001111000111 |
3 | 222220110210202111212 |
4 | 21231110311033013 |
5 | 132322033041241 |
6 | 4442212522035 |
7 | 516214330202 |
oct | 115524651707 |
9 | 28813722455 |
10 | 10424112071 |
11 | 446a15975a |
12 | 202b02031b |
13 | ca1821a69 |
14 | 70c602939 |
15 | 410235beb |
hex | 26d5353c7 |
10424112071 has 4 divisors (see below), whose sum is σ = 11037295152. Its totient is φ = 9810928992.
The previous prime is 10424112053. The next prime is 10424112079. The reversal of 10424112071 is 17021142401.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 17021142401 = 59 ⋅288493939.
It is a cyclic number.
It is not a de Polignac number, because 10424112071 - 214 = 10424095687 is a prime.
It is a super-2 number, since 2×104241120712 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10424112079) 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 3 ways as a sum of consecutive naturals, for example, 306591515 + ... + 306591548.
It is an arithmetic number, because the mean of its divisors is an integer number (2759323788).
Almost surely, 210424112071 is an apocalyptic number.
10424112071 is a deficient number, since it is larger than the sum of its proper divisors (613183081).
10424112071 is an equidigital number, since it uses as much as digits as its factorization.
10424112071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 613183080.
The product of its (nonzero) digits is 448, while the sum is 23.
Adding to 10424112071 its reverse (17021142401), we get a palindrome (27445254472).
The spelling of 10424112071 in words is "ten billion, four hundred twenty-four million, one hundred twelve thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •