Base | Representation |
---|---|
bin | 1110101000011… |
… | …1100011100001 |
3 | 11021111001102210 |
4 | 3222013203201 |
5 | 111202411031 |
6 | 10031232333 |
7 | 1343441661 |
oct | 352074341 |
9 | 137431383 |
10 | 61372641 |
11 | 317091a0 |
12 | 186786a9 |
13 | c93a995 |
14 | 82181a1 |
15 | 55c4746 |
hex | 3a878e1 |
61372641 has 16 divisors (see below), whose sum is σ = 93968640. Its totient is φ = 35237520.
The previous prime is 61372631. The next prime is 61372657. The reversal of 61372641 is 14627316.
61372641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 61372641 - 25 = 61372609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 61372599 and 61372608.
It is not an unprimeable number, because it can be changed into a prime (61372631) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 48315 + ... + 49568.
It is an arithmetic number, because the mean of its divisors is an integer number (5873040).
Almost surely, 261372641 is an apocalyptic number.
It is an amenable number.
61372641 is a deficient number, since it is larger than the sum of its proper divisors (32595999).
61372641 is a wasteful number, since it uses less digits than its factorization.
61372641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97916.
The product of its digits is 6048, while the sum is 30.
The square root of 61372641 is about 7834.0692491195. The cubic root of 61372641 is about 394.4496764028.
Adding to 61372641 its reverse (14627316), we get a palindrome (75999957).
It can be divided in two parts, 6137 and 2641, that added together give a palindrome (8778).
The spelling of 61372641 in words is "sixty-one million, three hundred seventy-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •