Base | Representation |
---|---|
bin | 11101111110101101111… |
… | …00010011011010100011 |
3 | 10122110212200010022221112 |
4 | 32333112330103122203 |
5 | 113334122422104011 |
6 | 2105120053013535 |
7 | 134264630501051 |
oct | 16772674233243 |
9 | 3573780108845 |
10 | 1030103316131 |
11 | 36795651595a |
12 | 1477836242ab |
13 | 761a4b95936 |
14 | 37c004a71d1 |
15 | 1bbde49c58b |
hex | efd6f136a3 |
1030103316131 has 2 divisors, whose sum is σ = 1030103316132. Its totient is φ = 1030103316130.
The previous prime is 1030103316113. The next prime is 1030103316211. The reversal of 1030103316131 is 1316133010301.
Together with previous prime (1030103316113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1030103316131 - 226 = 1030036207267 is a prime.
It is a super-2 number, since 2×10301033161312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1030103316097 and 1030103316106.
It is not a weakly prime, because it can be changed into another prime (1030103316331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515051658065 + 515051658066.
It is an arithmetic number, because the mean of its divisors is an integer number (515051658066).
Almost surely, 21030103316131 is an apocalyptic number.
1030103316131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030103316131 is an equidigital number, since it uses as much as digits as its factorization.
1030103316131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 1030103316131 its reverse (1316133010301), we get a palindrome (2346236326432).
The spelling of 1030103316131 in words is "one trillion, thirty billion, one hundred three million, three hundred sixteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •