Base | Representation |
---|---|
bin | 101111111110100010… |
… | …0010011000100010011 |
3 | 100211221100010210202011 |
4 | 1133331010103010103 |
5 | 3142001140311011 |
6 | 115155322403351 |
7 | 10305115431166 |
oct | 1377504230423 |
9 | 324840123664 |
10 | 103030010131 |
11 | 3a770833604 |
12 | 17b74660557 |
13 | 993c4a0749 |
14 | 4db5639add |
15 | 2a3025a621 |
hex | 17fd113113 |
103030010131 has 2 divisors, whose sum is σ = 103030010132. Its totient is φ = 103030010130.
The previous prime is 103030010129. The next prime is 103030010179. The reversal of 103030010131 is 131010030301.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (131010030301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103030010131 - 21 = 103030010129 is a prime.
It is a super-2 number, since 2×1030300101312 (a number of 23 digits) contains 22 as substring.
Together with 103030010129, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (103030010191) 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, 51515005065 + 51515005066.
It is an arithmetic number, because the mean of its divisors is an integer number (51515005066).
Almost surely, 2103030010131 is an apocalyptic number.
103030010131 is a deficient number, since it is larger than the sum of its proper divisors (1).
103030010131 is an equidigital number, since it uses as much as digits as its factorization.
103030010131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 13.
Adding to 103030010131 its reverse (131010030301), we get a palindrome (234040040432).
The spelling of 103030010131 in words is "one hundred three billion, thirty million, ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •