Base | Representation |
---|---|
bin | 1001001101111000… |
… | …00011110111001001 |
3 | 110202211222221100221 |
4 | 10212330003313021 |
5 | 40113222332321 |
6 | 2135002030041 |
7 | 233423253031 |
oct | 44674036711 |
9 | 13684887327 |
10 | 4948245961 |
11 | 210a17947a |
12 | b611a8321 |
13 | 60b20acb9 |
14 | 34d26c8c1 |
15 | 1de631e41 |
hex | 126f03dc9 |
4948245961 has 4 divisors (see below), whose sum is σ = 4951405312. Its totient is φ = 4945086612.
The previous prime is 4948245937. The next prime is 4948245971. The reversal of 4948245961 is 1695428494.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4948245961 - 211 = 4948243913 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4948245899 and 4948245908.
It is not an unprimeable number, because it can be changed into a prime (4948245971) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1577325 + ... + 1580458.
It is an arithmetic number, because the mean of its divisors is an integer number (1237851328).
Almost surely, 24948245961 is an apocalyptic number.
It is an amenable number.
4948245961 is a deficient number, since it is larger than the sum of its proper divisors (3159351).
4948245961 is a wasteful number, since it uses less digits than its factorization.
4948245961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3159350.
The product of its digits is 2488320, while the sum is 52.
The square root of 4948245961 is about 70343.7698804947. The cubic root of 4948245961 is about 1704.0555951842.
The spelling of 4948245961 in words is "four billion, nine hundred forty-eight million, two hundred forty-five thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •