Base | Representation |
---|---|
bin | 10010101110000110… |
… | …10101001011111101 |
3 | 221221102122112001002 |
4 | 21113003111023331 |
5 | 131040402104342 |
6 | 4341143300045 |
7 | 504026131232 |
oct | 112703251375 |
9 | 27842575032 |
10 | 10050425597 |
11 | 4298226563 |
12 | 1b45a4a625 |
13 | c422944c4 |
14 | 6b4b2b789 |
15 | 3dc51dd32 |
hex | 2570d52fd |
10050425597 has 2 divisors, whose sum is σ = 10050425598. Its totient is φ = 10050425596.
The previous prime is 10050425491. The next prime is 10050425617. The reversal of 10050425597 is 79552405001.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5084545636 + 4965879961 = 71306^2 + 70469^2 .
It is a cyclic number.
It is not a de Polignac number, because 10050425597 - 212 = 10050421501 is a prime.
It is a super-2 number, since 2×100504255972 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10050425597.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10050425197) 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 as a sum of consecutive naturals, namely, 5025212798 + 5025212799.
It is an arithmetic number, because the mean of its divisors is an integer number (5025212799).
Almost surely, 210050425597 is an apocalyptic number.
It is an amenable number.
10050425597 is a deficient number, since it is larger than the sum of its proper divisors (1).
10050425597 is an equidigital number, since it uses as much as digits as its factorization.
10050425597 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 63000, while the sum is 38.
The spelling of 10050425597 in words is "ten billion, fifty million, four hundred twenty-five thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •