Base | Representation |
---|---|
bin | 1110100011000… |
… | …0010011001001 |
3 | 11020210220011202 |
4 | 3220300103021 |
5 | 111104441431 |
6 | 10015433545 |
7 | 1340423000 |
oct | 350602311 |
9 | 136726152 |
10 | 61015241 |
11 | 31494721 |
12 | 185258b5 |
13 | c8440c1 |
14 | 8163c37 |
15 | 55538cb |
hex | 3a304c9 |
61015241 has 8 divisors (see below), whose sum is σ = 71155200. Its totient is φ = 52298484.
The previous prime is 61015219. The next prime is 61015247. The reversal of 61015241 is 14251016.
It is a de Polignac number, because none of the positive numbers 2k-61015241 is a prime.
It is a super-3 number, since 3×610152413 (a number of 24 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61015247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 88601 + ... + 89286.
It is an arithmetic number, because the mean of its divisors is an integer number (8894400).
Almost surely, 261015241 is an apocalyptic number.
It is an amenable number.
61015241 is a deficient number, since it is larger than the sum of its proper divisors (10139959).
61015241 is an equidigital number, since it uses as much as digits as its factorization.
61015241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177908 (or 177894 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 20.
The square root of 61015241 is about 7811.2253200122. The cubic root of 61015241 is about 393.6825003635.
Adding to 61015241 its reverse (14251016), we get a palindrome (75266257).
It can be divided in two parts, 610 and 15241, that added together give a palindrome (15851).
The spelling of 61015241 in words is "sixty-one million, fifteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •