Base | Representation |
---|---|
bin | 111110011010011… |
… | …101000000001011 |
3 | 2200222100022020202 |
4 | 332122131000023 |
5 | 4121030400211 |
6 | 251523242415 |
7 | 34643250422 |
oct | 7632350013 |
9 | 2628308222 |
10 | 1047121931 |
11 | 498089229 |
12 | 25281940b |
13 | 138c2859b |
14 | 9d0d62b9 |
15 | 61ddd53b |
hex | 3e69d00b |
1047121931 has 2 divisors, whose sum is σ = 1047121932. Its totient is φ = 1047121930.
The previous prime is 1047121909. The next prime is 1047121949. The reversal of 1047121931 is 1391217401.
1047121931 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 cyclic number.
It is not a de Polignac number, because 1047121931 - 218 = 1046859787 is a prime.
It is a super-2 number, since 2×10471219312 = 2192928676762337522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1047121894 and 1047121903.
It is not a weakly prime, because it can be changed into another prime (1047121981) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 523560965 + 523560966.
It is an arithmetic number, because the mean of its divisors is an integer number (523560966).
Almost surely, 21047121931 is an apocalyptic number.
1047121931 is a deficient number, since it is larger than the sum of its proper divisors (1).
1047121931 is an equidigital number, since it uses as much as digits as its factorization.
1047121931 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 29.
The square root of 1047121931 is about 32359.2634495904. The cubic root of 1047121931 is about 1015.4668534330.
The spelling of 1047121931 in words is "one billion, forty-seven million, one hundred twenty-one thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •