Base | Representation |
---|---|
bin | 111110100001010… |
… | …100100000011001 |
3 | 2201002201202200001 |
4 | 332201110200121 |
5 | 4122011002022 |
6 | 252030013001 |
7 | 34664456014 |
oct | 7641244031 |
9 | 2632652601 |
10 | 1048922137 |
11 | 4990a87aa |
12 | 253347161 |
13 | 139408ab3 |
14 | 9d44437b |
15 | 62146b27 |
hex | 3e854819 |
1048922137 has 2 divisors, whose sum is σ = 1048922138. Its totient is φ = 1048922136.
The previous prime is 1048922123. The next prime is 1048922167. The reversal of 1048922137 is 7312298401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 571018816 + 477903321 = 23896^2 + 21861^2 .
It is a cyclic number.
It is not a de Polignac number, because 1048922137 - 227 = 914704409 is a prime.
It is a super-2 number, since 2×10489221372 = 2200475298977293538, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1048922096 and 1048922105.
It is not a weakly prime, because it can be changed into another prime (1048922167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 524461068 + 524461069.
It is an arithmetic number, because the mean of its divisors is an integer number (524461069).
Almost surely, 21048922137 is an apocalyptic number.
It is an amenable number.
1048922137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1048922137 is an equidigital number, since it uses as much as digits as its factorization.
1048922137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24192, while the sum is 37.
The square root of 1048922137 is about 32387.0674343942. The cubic root of 1048922137 is about 1016.0484485262.
The spelling of 1048922137 in words is "one billion, forty-eight million, nine hundred twenty-two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •