Base | Representation |
---|---|
bin | 1001010111100110101000… |
… | …1010101000111100101101 |
3 | 1100110202222020222211102121 |
4 | 2111321222022220330231 |
5 | 2322233134330443434 |
6 | 33524133232152541 |
7 | 2112142114444444 |
oct | 225715212507455 |
9 | 40422866884377 |
10 | 10301112749869 |
11 | 331174a663807 |
12 | 11a4511998751 |
13 | 5995106801b6 |
14 | 27880dd6bd5b |
15 | 12ce501557b4 |
hex | 95e6a2a8f2d |
10301112749869 has 2 divisors, whose sum is σ = 10301112749870. Its totient is φ = 10301112749868.
The previous prime is 10301112749857. The next prime is 10301112749909. The reversal of 10301112749869 is 96894721110301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7590934177225 + 2710178572644 = 2755165^2 + 1646262^2 .
It is a cyclic number.
It is not a de Polignac number, because 10301112749869 - 29 = 10301112749357 is a prime.
It is a super-2 number, since 2×103011127498692 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10301112749839) 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, 5150556374934 + 5150556374935.
It is an arithmetic number, because the mean of its divisors is an integer number (5150556374935).
Almost surely, 210301112749869 is an apocalyptic number.
It is an amenable number.
10301112749869 is a deficient number, since it is larger than the sum of its proper divisors (1).
10301112749869 is an equidigital number, since it uses as much as digits as its factorization.
10301112749869 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 653184, while the sum is 52.
The spelling of 10301112749869 in words is "ten trillion, three hundred one billion, one hundred twelve million, seven hundred forty-nine thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •