Base | Representation |
---|---|
bin | 1110101000111… |
… | …0100010110001 |
3 | 11021112111200221 |
4 | 3222032202301 |
5 | 111204320030 |
6 | 10032013041 |
7 | 1343621302 |
oct | 352164261 |
9 | 137474627 |
10 | 61401265 |
11 | 31728752 |
12 | 18691181 |
13 | c94aa13 |
14 | 82247a9 |
15 | 55cce7a |
hex | 3a8e8b1 |
61401265 has 8 divisors (see below), whose sum is σ = 76222440. Its totient is φ = 47427072.
The previous prime is 61401259. The next prime is 61401271. The reversal of 61401265 is 56210416.
61401265 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (61401259) and next prime (61401271).
It can be written as a sum of positive squares in 4 ways, for example, as 935089 + 60466176 = 967^2 + 7776^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 61401265 - 215 = 61368497 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 211584 + ... + 211873.
It is an arithmetic number, because the mean of its divisors is an integer number (9527805).
Almost surely, 261401265 is an apocalyptic number.
It is an amenable number.
61401265 is a deficient number, since it is larger than the sum of its proper divisors (14821175).
61401265 is a wasteful number, since it uses less digits than its factorization.
61401265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 423491.
The product of its (nonzero) digits is 1440, while the sum is 25.
The square root of 61401265 is about 7835.8959283543. The cubic root of 61401265 is about 394.5109902200.
The spelling of 61401265 in words is "sixty-one million, four hundred one thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •