Base | Representation |
---|---|
bin | 101011010000100… |
… | …100011111001011 |
3 | 1212120122122002202 |
4 | 223100210133023 |
5 | 2441243422133 |
6 | 200003350415 |
7 | 23661615104 |
oct | 5320443713 |
9 | 1776578082 |
10 | 725764043 |
11 | 3427472a4 |
12 | 18308240b |
13 | b74902a4 |
14 | 6c5633ab |
15 | 43ab12e8 |
hex | 2b4247cb |
725764043 has 2 divisors, whose sum is σ = 725764044. Its totient is φ = 725764042.
The previous prime is 725764027. The next prime is 725764069. The reversal of 725764043 is 340467527.
725764043 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (340467527) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 725764043 - 24 = 725764027 is a prime.
It is a super-2 number, since 2×7257640432 = 1053466892223411698, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 725763988 and 725764006.
It is not a weakly prime, because it can be changed into another prime (725764003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 362882021 + 362882022.
It is an arithmetic number, because the mean of its divisors is an integer number (362882022).
Almost surely, 2725764043 is an apocalyptic number.
725764043 is a deficient number, since it is larger than the sum of its proper divisors (1).
725764043 is an equidigital number, since it uses as much as digits as its factorization.
725764043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 141120, while the sum is 38.
The square root of 725764043 is about 26940.0082219735. The cubic root of 725764043 is about 898.6663551972. Note that the first 3 decimals are identical.
The spelling of 725764043 in words is "seven hundred twenty-five million, seven hundred sixty-four thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •