Base | Representation |
---|---|
bin | 10011001011111111… |
… | …00111101101001001 |
3 | 222120220100122220211 |
4 | 21211333213231021 |
5 | 132044041023423 |
6 | 4422100321121 |
7 | 513161666626 |
oct | 114577475511 |
9 | 28526318824 |
10 | 10301111113 |
11 | 4406788277 |
12 | 1bb59a31a1 |
13 | c821b6c27 |
14 | 6da14534d |
15 | 40453b10d |
hex | 265fe7b49 |
10301111113 has 2 divisors, whose sum is σ = 10301111114. Its totient is φ = 10301111112.
The previous prime is 10301111101. The next prime is 10301111123. The reversal of 10301111113 is 31111110301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9854929984 + 446181129 = 99272^2 + 21123^2 .
It is a cyclic number.
It is not a de Polignac number, because 10301111113 - 213 = 10301102921 is a prime.
It is a super-2 number, since 2×103011111132 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10301111093 and 10301111102.
It is not a weakly prime, because it can be changed into another prime (10301111123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5150555556 + 5150555557.
It is an arithmetic number, because the mean of its divisors is an integer number (5150555557).
Almost surely, 210301111113 is an apocalyptic number.
It is an amenable number.
10301111113 is a deficient number, since it is larger than the sum of its proper divisors (1).
10301111113 is an equidigital number, since it uses as much as digits as its factorization.
10301111113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 10301111113 its reverse (31111110301), we get a palindrome (41412221414).
The spelling of 10301111113 in words is "ten billion, three hundred one million, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •