Base | Representation |
---|---|
bin | 10111011011010011000111… |
… | …011010100000111100100111 |
3 | 111111210200002000021121222122 |
4 | 113123103013122200330213 |
5 | 102001030012401110002 |
6 | 1003043444144220155 |
7 | 30462513515412362 |
oct | 2733230732407447 |
9 | 444720060247878 |
10 | 103031021113127 |
11 | 2a913235450328 |
12 | b68012860a65b |
13 | 4564a2575b093 |
14 | 1b62a299d90d9 |
15 | bda1175de6a2 |
hex | 5db4c76a0f27 |
103031021113127 has 2 divisors, whose sum is σ = 103031021113128. Its totient is φ = 103031021113126.
The previous prime is 103031021113093. The next prime is 103031021113177. The reversal of 103031021113127 is 721311120130301.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 103031021113127 - 212 = 103031021109031 is a prime.
It is a super-2 number, since 2×1030310211131272 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103031021113096 and 103031021113105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103031021113177) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51515510556563 + 51515510556564.
It is an arithmetic number, because the mean of its divisors is an integer number (51515510556564).
Almost surely, 2103031021113127 is an apocalyptic number.
103031021113127 is a deficient number, since it is larger than the sum of its proper divisors (1).
103031021113127 is an equidigital number, since it uses as much as digits as its factorization.
103031021113127 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 756, while the sum is 26.
Adding to 103031021113127 its reverse (721311120130301), we get a palindrome (824342141243428).
The spelling of 103031021113127 in words is "one hundred three trillion, thirty-one billion, twenty-one million, one hundred thirteen thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •