Base | Representation |
---|---|
bin | 100011101101000110010… |
… | …1101010000001011110001 |
3 | 122101010101010121122220012 |
4 | 1013122030231100023301 |
5 | 1120344433102400131 |
6 | 14234202004024305 |
7 | 1014351215015606 |
oct | 107321455201361 |
9 | 18333333548805 |
10 | 4907213325041 |
11 | 1622156a9a315 |
12 | 673073992095 |
13 | 297995b2bbc1 |
14 | 12d7207326ad |
15 | 879ab8dd52b |
hex | 4768cb502f1 |
4907213325041 has 4 divisors (see below), whose sum is σ = 4907294774772. Its totient is φ = 4907131875312.
The previous prime is 4907213325037. The next prime is 4907213325073. The reversal of 4907213325041 is 1405233127094.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 733789258225 + 4173424066816 = 856615^2 + 2042896^2 .
It is a cyclic number.
It is not a de Polignac number, because 4907213325041 - 22 = 4907213325037 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4907213325041.
It is not an unprimeable number, because it can be changed into a prime (4907213325011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 40634426 + ... + 40755011.
It is an arithmetic number, because the mean of its divisors is an integer number (1226823693693).
Almost surely, 24907213325041 is an apocalyptic number.
It is an amenable number.
4907213325041 is a deficient number, since it is larger than the sum of its proper divisors (81449731).
4907213325041 is an equidigital number, since it uses as much as digits as its factorization.
4907213325041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 81449730.
The product of its (nonzero) digits is 181440, while the sum is 41.
The spelling of 4907213325041 in words is "four trillion, nine hundred seven billion, two hundred thirteen million, three hundred twenty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •