Base | Representation |
---|---|
bin | 1110101010100… |
… | …0101001001100 |
3 | 11021201221100110 |
4 | 3222220221030 |
5 | 111221230142 |
6 | 10034200020 |
7 | 1344545055 |
oct | 352505114 |
9 | 137657313 |
10 | 61508172 |
11 | 317a1000 |
12 | 18723010 |
13 | c98758b |
14 | 825172c |
15 | 55ee99c |
hex | 3aa8a4c |
61508172 has 48 divisors (see below), whose sum is σ = 157901184. Its totient is φ = 18634000.
The previous prime is 61508137. The next prime is 61508197. The reversal of 61508172 is 27180516.
It is a super-3 number, since 3×615081723 (a number of 24 digits) contains 333 as substring.
It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14047 + ... + 17897.
It is an arithmetic number, because the mean of its divisors is an integer number (3289608).
Almost surely, 261508172 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 61508172, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (78950592).
61508172 is an abundant number, since it is smaller than the sum of its proper divisors (96393012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61508172 is a wasteful number, since it uses less digits than its factorization.
61508172 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3891 (or 3867 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 30.
The square root of 61508172 is about 7842.7145810618. The cubic root of 61508172 is about 394.7398211855.
Adding to 61508172 its reverse (27180516), we get a palindrome (88688688).
The spelling of 61508172 in words is "sixty-one million, five hundred eight thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •