Base | Representation |
---|---|
bin | 101011100000101… |
… | …111110100000101 |
3 | 1212212122002020122 |
4 | 223200233310011 |
5 | 2443340122431 |
6 | 200234311325 |
7 | 24042636464 |
oct | 5340576405 |
9 | 1785562218 |
10 | 730004741 |
11 | 345083404 |
12 | 184588545 |
13 | b831658b |
14 | 6cd489db |
15 | 4414ca7b |
hex | 2b82fd05 |
730004741 has 2 divisors, whose sum is σ = 730004742. Its totient is φ = 730004740.
The previous prime is 730004729. The next prime is 730004749. The reversal of 730004741 is 147400037.
730004741 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 688852516 + 41152225 = 26246^2 + 6415^2 .
It is a cyclic number.
It is not a de Polignac number, because 730004741 - 26 = 730004677 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 730004741.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (730004749) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 365002370 + 365002371.
It is an arithmetic number, because the mean of its divisors is an integer number (365002371).
Almost surely, 2730004741 is an apocalyptic number.
It is an amenable number.
730004741 is a deficient number, since it is larger than the sum of its proper divisors (1).
730004741 is an equidigital number, since it uses as much as digits as its factorization.
730004741 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2352, while the sum is 26.
The square root of 730004741 is about 27018.5999082114. The cubic root of 730004741 is about 900.4132838518.
Adding to 730004741 its reverse (147400037), we get a palindrome (877404778).
The spelling of 730004741 in words is "seven hundred thirty million, four thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •