Base | Representation |
---|---|
bin | 111001101101111000… |
… | …000110000000000000 |
3 | 12220222000001201122002 |
4 | 321231320012000000 |
5 | 2003410034311303 |
6 | 44245303403132 |
7 | 4322514332243 |
oct | 715570060000 |
9 | 186860051562 |
10 | 61972963328 |
11 | 24312138671 |
12 | 100167534a8 |
13 | 5ac8429303 |
14 | 2ddc91125a |
15 | 192aa74788 |
hex | e6de06000 |
61972963328 has 84 divisors (see below), whose sum is σ = 130668514380. Its totient is φ = 29309091840.
The previous prime is 61972963321. The next prime is 61972963337. The reversal of 61972963328 is 82336927916.
It is a Smith number, since the sum of its digits (56) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61972963321) 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 5 ways as a sum of consecutive naturals, for example, 98213573 + ... + 98214203.
Almost surely, 261972963328 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 61972963328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (65334257190).
61972963328 is an abundant number, since it is smaller than the sum of its proper divisors (68695551052).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61972963328 is an frugal number, since it uses more digits than its factorization.
61972963328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1307 (or 652 counting only the distinct ones).
The product of its digits is 5878656, while the sum is 56.
The spelling of 61972963328 in words is "sixty-one billion, nine hundred seventy-two million, nine hundred sixty-three thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •