Base | Representation |
---|---|
bin | 101100011101001… |
… | …100100101101001 |
3 | 1220222110011120001 |
4 | 230131030211221 |
5 | 3011414214431 |
6 | 202002103001 |
7 | 24324426262 |
oct | 5435144551 |
9 | 1828404501 |
10 | 745851241 |
11 | 353017093 |
12 | 18994aa61 |
13 | bb6a42c5 |
14 | 710b1969 |
15 | 4572ce61 |
hex | 2c74c969 |
745851241 has 2 divisors, whose sum is σ = 745851242. Its totient is φ = 745851240.
The previous prime is 745851233. The next prime is 745851247. The reversal of 745851241 is 142158547.
745851241 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., 718025616 + 27825625 = 26796^2 + 5275^2 .
It is an emirp because it is prime and its reverse (142158547) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 745851241 - 23 = 745851233 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 745851241.
It is not a weakly prime, because it can be changed into another prime (745851247) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 372925620 + 372925621.
It is an arithmetic number, because the mean of its divisors is an integer number (372925621).
Almost surely, 2745851241 is an apocalyptic number.
It is an amenable number.
745851241 is a deficient number, since it is larger than the sum of its proper divisors (1).
745851241 is an equidigital number, since it uses as much as digits as its factorization.
745851241 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 44800, while the sum is 37.
The square root of 745851241 is about 27310.2772047447. The cubic root of 745851241 is about 906.8819099667.
The spelling of 745851241 in words is "seven hundred forty-five million, eight hundred fifty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.964 sec. • engine limits •