Base | Representation |
---|---|
bin | 101100001101000… |
… | …1001001000000011 |
3 | 10211100222210220222 |
4 | 1120122021020003 |
5 | 11014202420011 |
6 | 403103053255 |
7 | 51520254401 |
oct | 13032111003 |
9 | 3740883828 |
10 | 1483248131 |
11 | 6a1289302 |
12 | 3548a122b |
13 | 1a83a8421 |
14 | 100dc2471 |
15 | 8a33addb |
hex | 58689203 |
1483248131 has 2 divisors, whose sum is σ = 1483248132. Its totient is φ = 1483248130.
The previous prime is 1483248071. The next prime is 1483248133. The reversal of 1483248131 is 1318423841.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1483248131 - 214 = 1483231747 is a prime.
It is a super-2 number, since 2×14832481312 = 4400050036229986322, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 1483248133, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1483248091 and 1483248100.
It is not a weakly prime, because it can be changed into another prime (1483248133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 741624065 + 741624066.
It is an arithmetic number, because the mean of its divisors is an integer number (741624066).
Almost surely, 21483248131 is an apocalyptic number.
1483248131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1483248131 is an equidigital number, since it uses as much as digits as its factorization.
1483248131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 18432, while the sum is 35.
The square root of 1483248131 is about 38512.9605587522. The cubic root of 1483248131 is about 1140.4369236767.
The spelling of 1483248131 in words is "one billion, four hundred eighty-three million, two hundred forty-eight thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •