Base | Representation |
---|---|
bin | 1001001000100110… |
… | …01011001000110001 |
3 | 110122202200122212101 |
4 | 10210103023020301 |
5 | 40020404122200 |
6 | 2130341100401 |
7 | 232345041421 |
oct | 44423131061 |
9 | 13582618771 |
10 | 4903973425 |
11 | 209718a8aa |
12 | b4a3b7701 |
13 | 601ca9830 |
14 | 347426481 |
15 | 1da7d926a |
hex | 1244cb231 |
4903973425 has 48 divisors (see below), whose sum is σ = 7012519920. Its totient is φ = 3369738240.
The previous prime is 4903973413. The next prime is 4903973429. The reversal of 4903973425 is 5243793094.
It can be written as a sum of positive squares in 24 ways, for example, as 4680201744 + 223771681 = 68412^2 + 14959^2 .
It is not a de Polignac number, because 4903973425 - 213 = 4903965233 is a prime.
It is a super-3 number, since 3×49039734253 (a number of 30 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (4903973429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 486739 + ... + 496711.
It is an arithmetic number, because the mean of its divisors is an integer number (146094165).
Almost surely, 24903973425 is an apocalyptic number.
It is an amenable number.
4903973425 is a deficient number, since it is larger than the sum of its proper divisors (2108546495).
4903973425 is a wasteful number, since it uses less digits than its factorization.
4903973425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10102 (or 10097 counting only the distinct ones).
The product of its (nonzero) digits is 816480, while the sum is 46.
The square root of 4903973425 is about 70028.3758557915. The cubic root of 4903973425 is about 1698.9582342819.
The spelling of 4903973425 in words is "four billion, nine hundred three million, nine hundred seventy-three thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •