Base | Representation |
---|---|
bin | 10111011100111010100000… |
… | …001001010001000111101111 |
3 | 111112012021121111210000201212 |
4 | 113130322200021101013233 |
5 | 102004334340021231002 |
6 | 1003210443424425035 |
7 | 30503523455503424 |
oct | 2734724011210757 |
9 | 445167544700655 |
10 | 103142031430127 |
11 | 2a956320920568 |
12 | b69974977817b |
13 | 45723373680a1 |
14 | 1b6815b053d4b |
15 | bdce63255352 |
hex | 5dcea02511ef |
103142031430127 has 2 divisors, whose sum is σ = 103142031430128. Its totient is φ = 103142031430126.
The previous prime is 103142031430099. The next prime is 103142031430187. The reversal of 103142031430127 is 721034130241301.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 103142031430127 - 222 = 103142027235823 is a prime.
It is a super-2 number, since 2×1031420314301272 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103142031430093 and 103142031430102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103142031430187) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51571015715063 + 51571015715064.
It is an arithmetic number, because the mean of its divisors is an integer number (51571015715064).
Almost surely, 2103142031430127 is an apocalyptic number.
103142031430127 is a deficient number, since it is larger than the sum of its proper divisors (1).
103142031430127 is an equidigital number, since it uses as much as digits as its factorization.
103142031430127 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12096, while the sum is 32.
Adding to 103142031430127 its reverse (721034130241301), we get a palindrome (824176161671428).
The spelling of 103142031430127 in words is "one hundred three trillion, one hundred forty-two billion, thirty-one million, four hundred thirty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •