Base | Representation |
---|---|
bin | 1101001101110101110001011… |
… | …0100000101100110000010111 |
3 | 11111221220012021001212110000212 |
4 | 3103131130112200230300113 |
5 | 1433344300234001010124 |
6 | 13053545113320000035 |
7 | 366615041362346003 |
oct | 32335342640546027 |
9 | 4457805231773025 |
10 | 930011121110039 |
11 | 24a36a557588051 |
12 | 8838247690001b |
13 | 30bc18983a0567 |
14 | 12592ac8049703 |
15 | 727bacbd1940e |
hex | 34dd71682cc17 |
930011121110039 has 2 divisors, whose sum is σ = 930011121110040. Its totient is φ = 930011121110038.
The previous prime is 930011121110017. The next prime is 930011121110059.
It is a happy number.
930011121110039 is nontrivially palindromic in base 10.
930011121110039 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a palprime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-930011121110039 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 930011121109987 and 930011121110014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (930011121110059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 465005560555019 + 465005560555020.
It is an arithmetic number, because the mean of its divisors is an integer number (465005560555020).
Almost surely, 2930011121110039 is an apocalyptic number.
930011121110039 is a deficient number, since it is larger than the sum of its proper divisors (1).
930011121110039 is an equidigital number, since it uses as much as digits as its factorization.
930011121110039 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 32.
The spelling of 930011121110039 in words is "nine hundred thirty trillion, eleven billion, one hundred twenty-one million, one hundred ten thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •