Base | Representation |
---|---|
bin | 101100001011001… |
… | …1011000101110001 |
3 | 10211022011021111002 |
4 | 1120112123011301 |
5 | 11013430220022 |
6 | 403030131345 |
7 | 51506054012 |
oct | 13026330561 |
9 | 3738137432 |
10 | 1482273137 |
11 | 6a0782824 |
12 | 3544b0b55 |
13 | 1a81266c7 |
14 | 100c0b009 |
15 | 8a1e7092 |
hex | 5859b171 |
1482273137 has 2 divisors, whose sum is σ = 1482273138. Its totient is φ = 1482273136.
The previous prime is 1482273131. The next prime is 1482273139. The reversal of 1482273137 is 7313722841.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1466583616 + 15689521 = 38296^2 + 3961^2 .
It is a cyclic number.
It is not a de Polignac number, because 1482273137 - 214 = 1482256753 is a prime.
Together with 1482273139, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1482273137.
It is not a weakly prime, because it can be changed into another prime (1482273131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 741136568 + 741136569.
It is an arithmetic number, because the mean of its divisors is an integer number (741136569).
Almost surely, 21482273137 is an apocalyptic number.
It is an amenable number.
1482273137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1482273137 is an equidigital number, since it uses as much as digits as its factorization.
1482273137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 56448, while the sum is 38.
The square root of 1482273137 is about 38500.3004793469. The cubic root of 1482273137 is about 1140.1869850771.
Adding to 1482273137 its reverse (7313722841), we get a palindrome (8795995978).
The spelling of 1482273137 in words is "one billion, four hundred eighty-two million, two hundred seventy-three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •