Base | Representation |
---|---|
bin | 1111011110000000… |
… | …1000110010010101 |
3 | 101201101110121202121 |
4 | 3313200020302111 |
5 | 32001003200244 |
6 | 1524012135541 |
7 | 204620535361 |
oct | 36740106225 |
9 | 11641417677 |
10 | 4152396949 |
11 | 1840a13318 |
12 | 97a7675b1 |
13 | 51237c61c |
14 | 2b56a42a1 |
15 | 194829c84 |
hex | f7808c95 |
4152396949 has 2 divisors, whose sum is σ = 4152396950. Its totient is φ = 4152396948.
The previous prime is 4152396947. The next prime is 4152396991. The reversal of 4152396949 is 9496932514.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4080909924 + 71487025 = 63882^2 + 8455^2 .
It is a cyclic number.
It is not a de Polignac number, because 4152396949 - 21 = 4152396947 is a prime.
It is a super-3 number, since 3×41523969493 (a number of 30 digits) contains 333 as substring.
Together with 4152396947, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 4152396896 and 4152396905.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4152396943) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2076198474 + 2076198475.
It is an arithmetic number, because the mean of its divisors is an integer number (2076198475).
Almost surely, 24152396949 is an apocalyptic number.
It is an amenable number.
4152396949 is a deficient number, since it is larger than the sum of its proper divisors (1).
4152396949 is an equidigital number, since it uses as much as digits as its factorization.
4152396949 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2099520, while the sum is 52.
The square root of 4152396949 is about 64439.0948803597. The cubic root of 4152396949 is about 1607.3099051786.
The spelling of 4152396949 in words is "four billion, one hundred fifty-two million, three hundred ninety-six thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •