Base | Representation |
---|---|
bin | 1000110011111100… |
… | …00011000010000001 |
3 | 110012200120120201021 |
4 | 10121332003002001 |
5 | 34142022204131 |
6 | 2101230305441 |
7 | 225141654346 |
oct | 43176030201 |
9 | 13180516637 |
10 | 4730663041 |
11 | 2008377185 |
12 | b00358281 |
13 | 5a5108800 |
14 | 32c3d07cd |
15 | 1ca4a2e11 |
hex | 119f83081 |
4730663041 has 12 divisors (see below), whose sum is σ = 5130287148. Its totient is φ = 4360172544.
The previous prime is 4730663027. The next prime is 4730663051. The reversal of 4730663041 is 1403660374.
It can be written as a sum of positive squares in 6 ways, for example, as 1706103025 + 3024560016 = 41305^2 + 54996^2 .
It is not a de Polignac number, because 4730663041 - 29 = 4730662529 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4730662988 and 4730663006.
It is not an unprimeable number, because it can be changed into a prime (4730663051) 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 11 ways as a sum of consecutive naturals, for example, 92941 + ... + 134533.
It is an arithmetic number, because the mean of its divisors is an integer number (427523929).
Almost surely, 24730663041 is an apocalyptic number.
It is an amenable number.
4730663041 is a deficient number, since it is larger than the sum of its proper divisors (399624107).
4730663041 is a wasteful number, since it uses less digits than its factorization.
4730663041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42292 (or 42279 counting only the distinct ones).
The product of its (nonzero) digits is 36288, while the sum is 34.
The square root of 4730663041 is about 68779.8156511051. The cubic root of 4730663041 is about 1678.7035350339.
The spelling of 4730663041 in words is "four billion, seven hundred thirty million, six hundred sixty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •