Base | Representation |
---|---|
bin | 1001011110110010010100… |
… | …1111011000001101010101 |
3 | 1100220120111001110202020022 |
4 | 2113230211033120031111 |
5 | 2331243344131300301 |
6 | 34100542020314525 |
7 | 2124101041343234 |
oct | 227544517301525 |
9 | 40816431422208 |
10 | 10424510415701 |
11 | 335a0123aa518 |
12 | 120440b542a45 |
13 | 5a8047753b05 |
14 | 280798634b1b |
15 | 131273551d1b |
hex | 97b253d8355 |
10424510415701 has 2 divisors, whose sum is σ = 10424510415702. Its totient is φ = 10424510415700.
The previous prime is 10424510415623. The next prime is 10424510415703. The reversal of 10424510415701 is 10751401542401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10267218062500 + 157292353201 = 3204250^2 + 396601^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10424510415701 is a prime.
Together with 10424510415703, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10424510415703) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5212255207850 + 5212255207851.
It is an arithmetic number, because the mean of its divisors is an integer number (5212255207851).
Almost surely, 210424510415701 is an apocalyptic number.
It is an amenable number.
10424510415701 is a deficient number, since it is larger than the sum of its proper divisors (1).
10424510415701 is an equidigital number, since it uses as much as digits as its factorization.
10424510415701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22400, while the sum is 35.
The spelling of 10424510415701 in words is "ten trillion, four hundred twenty-four billion, five hundred ten million, four hundred fifteen thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •