Base | Representation |
---|---|
bin | 111001101011110001… |
… | …111000010100000000 |
3 | 12220212112212020010200 |
4 | 321223301320110000 |
5 | 2003322032424333 |
6 | 44242005325200 |
7 | 4321606304661 |
oct | 715361702400 |
9 | 186775766120 |
10 | 61937779968 |
11 | 242a4297909 |
12 | 10006a06800 |
13 | 5ac105ac5c |
14 | 2dd7d93368 |
15 | 1927924c13 |
hex | e6bc78500 |
61937779968 has 108 divisors (see below), whose sum is σ = 180589024980. Its totient is φ = 20413882368.
The previous prime is 61937779951. The next prime is 61937780041. The reversal of 61937779968 is 86997773916.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 5506827264 + 56430952704 = 74208^2 + 237552^2 .
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a junction number, because it is equal to n+sod(n) for n = 61937779896 and 61937779905.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 54030 + ... + 356082.
Almost surely, 261937779968 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 61937779968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (90294512490).
61937779968 is an abundant number, since it is smaller than the sum of its proper divisors (118651245012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61937779968 is a wasteful number, since it uses less digits than its factorization.
61937779968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 302164 (or 302147 counting only the distinct ones).
The product of its digits is 216040608, while the sum is 72.
The spelling of 61937779968 in words is "sixty-one billion, nine hundred thirty-seven million, seven hundred seventy-nine thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •