Base | Representation |
---|---|
bin | 10010101111010011… |
… | …11010011110000101 |
3 | 221222010200101002111 |
4 | 21113221322132011 |
5 | 131100444233111 |
6 | 4342144141021 |
7 | 504211114525 |
oct | 112751723605 |
9 | 27863611074 |
10 | 10060539781 |
11 | 42a2a04496 |
12 | 1b49307771 |
13 | c443c6026 |
14 | 6b6201685 |
15 | 3dd36aa21 |
hex | 257a7a785 |
10060539781 has 2 divisors, whose sum is σ = 10060539782. Its totient is φ = 10060539780.
The previous prime is 10060539761. The next prime is 10060539887. The reversal of 10060539781 is 18793506001.
10060539781 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9717030625 + 343509156 = 98575^2 + 18534^2 .
It is a cyclic number.
It is not a de Polignac number, because 10060539781 - 211 = 10060537733 is a prime.
It is a super-2 number, since 2×100605397812 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10060539761) 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, 5030269890 + 5030269891.
It is an arithmetic number, because the mean of its divisors is an integer number (5030269891).
Almost surely, 210060539781 is an apocalyptic number.
It is an amenable number.
10060539781 is a deficient number, since it is larger than the sum of its proper divisors (1).
10060539781 is an equidigital number, since it uses as much as digits as its factorization.
10060539781 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45360, while the sum is 40.
The spelling of 10060539781 in words is "ten billion, sixty million, five hundred thirty-nine thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •