Base | Representation |
---|---|
bin | 11101001101010… |
… | …11100001000101 |
3 | 122002001100021021 |
4 | 32212223201011 |
5 | 1000211130431 |
6 | 40151351141 |
7 | 6033433120 |
oct | 1646534105 |
9 | 562040237 |
10 | 245020741 |
11 | 116342789 |
12 | 6a0824b1 |
13 | 3b9bb1b4 |
14 | 247813b7 |
15 | 1679db11 |
hex | e9ab845 |
245020741 has 4 divisors (see below), whose sum is σ = 280023712. Its totient is φ = 210017772.
The previous prime is 245020733. The next prime is 245020747. The reversal of 245020741 is 147020542.
245020741 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 147020542 = 2 ⋅73510271.
It is a cyclic number.
It is not a de Polignac number, because 245020741 - 23 = 245020733 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (245020747) 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, 17501475 + ... + 17501488.
It is an arithmetic number, because the mean of its divisors is an integer number (70005928).
Almost surely, 2245020741 is an apocalyptic number.
It is an amenable number.
245020741 is a deficient number, since it is larger than the sum of its proper divisors (35002971).
245020741 is an equidigital number, since it uses as much as digits as its factorization.
245020741 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35002970.
The product of its (nonzero) digits is 2240, while the sum is 25.
The square root of 245020741 is about 15653.1383754185. The cubic root of 245020741 is about 625.7501316438.
The spelling of 245020741 in words is "two hundred forty-five million, twenty thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •