Base | Representation |
---|---|
bin | 10011001100000010… |
… | …10001100010100101 |
3 | 222120221011200120101 |
4 | 21212001101202211 |
5 | 132044143411423 |
6 | 4422113504101 |
7 | 513165453523 |
oct | 114601214245 |
9 | 28527150511 |
10 | 10301544613 |
11 | 4406a53a38 |
12 | 1bb5b72031 |
13 | c82309339 |
14 | 6da219313 |
15 | 4045c47ad |
hex | 2660518a5 |
10301544613 has 2 divisors, whose sum is σ = 10301544614. Its totient is φ = 10301544612.
The previous prime is 10301544611. The next prime is 10301544661. The reversal of 10301544613 is 31644510301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9961437249 + 340107364 = 99807^2 + 18442^2 .
It is an emirp because it is prime and its reverse (31644510301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10301544613 - 21 = 10301544611 is a prime.
It is a super-2 number, since 2×103015446132 (a number of 21 digits) contains 22 as substring.
Together with 10301544611, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10301544611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5150772306 + 5150772307.
It is an arithmetic number, because the mean of its divisors is an integer number (5150772307).
Almost surely, 210301544613 is an apocalyptic number.
It is an amenable number.
10301544613 is a deficient number, since it is larger than the sum of its proper divisors (1).
10301544613 is an equidigital number, since it uses as much as digits as its factorization.
10301544613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 28.
The spelling of 10301544613 in words is "ten billion, three hundred one million, five hundred forty-four thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •