Base | Representation |
---|---|
bin | 100000010000010… |
… | …0010000110111001 |
3 | 2210102111000112011 |
4 | 1000200202012321 |
5 | 4204030121022 |
6 | 255220445521 |
7 | 35551100344 |
oct | 10040420671 |
9 | 2712430464 |
10 | 1082270137 |
11 | 505a05633 |
12 | 2625498a1 |
13 | 1432b3940 |
14 | a3a4545b |
15 | 65032977 |
hex | 408221b9 |
1082270137 has 8 divisors (see below), whose sum is σ = 1165783304. Its totient is φ = 998794368.
The previous prime is 1082270107. The next prime is 1082270141. The reversal of 1082270137 is 7310722801.
It can be written as a sum of positive squares in 4 ways, for example, as 77633721 + 1004636416 = 8811^2 + 31696^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1082270137 - 27 = 1082270009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1082270099 and 1082270108.
It is not an unprimeable number, because it can be changed into a prime (1082270107) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 89653 + ... + 101005.
It is an arithmetic number, because the mean of its divisors is an integer number (145722913).
Almost surely, 21082270137 is an apocalyptic number.
It is an amenable number.
1082270137 is a deficient number, since it is larger than the sum of its proper divisors (83513167).
1082270137 is a wasteful number, since it uses less digits than its factorization.
1082270137 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18699.
The product of its (nonzero) digits is 4704, while the sum is 31.
The square root of 1082270137 is about 32897.8743538241. The cubic root of 1082270137 is about 1026.7039315174.
Adding to 1082270137 its reverse (7310722801), we get a palindrome (8392992938).
The spelling of 1082270137 in words is "one billion, eighty-two million, two hundred seventy thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •