Base | Representation |
---|---|
bin | 10111011100110010000111… |
… | …101000110101010111001111 |
3 | 111112011102101012122021102012 |
4 | 113130302013220311113033 |
5 | 102004212421231340142 |
6 | 1003202354324051435 |
7 | 30503054430502331 |
oct | 2734620750652717 |
9 | 445142335567365 |
10 | 103133030340047 |
11 | 2a952521a55344 |
12 | b697a57233b7b |
13 | 45715315c5896 |
14 | 1b67945837451 |
15 | bdcad7e10882 |
hex | 5dcc87a355cf |
103133030340047 has 2 divisors, whose sum is σ = 103133030340048. Its totient is φ = 103133030340046.
The previous prime is 103133030340029. The next prime is 103133030340127. The reversal of 103133030340047 is 740043030331301.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 103133030340047 - 216 = 103133030274511 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103133030339995 and 103133030340022.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103133030240047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51566515170023 + 51566515170024.
It is an arithmetic number, because the mean of its divisors is an integer number (51566515170024).
Almost surely, 2103133030340047 is an apocalyptic number.
103133030340047 is a deficient number, since it is larger than the sum of its proper divisors (1).
103133030340047 is an equidigital number, since it uses as much as digits as its factorization.
103133030340047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27216, while the sum is 32.
Adding to 103133030340047 its reverse (740043030331301), we get a palindrome (843176060671348).
The spelling of 103133030340047 in words is "one hundred three trillion, one hundred thirty-three billion, thirty million, three hundred forty thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •