Base | Representation |
---|---|
bin | 111010110110111000… |
… | …111111111011110100 |
3 | 20001010101001212011000 |
4 | 322312320333323310 |
5 | 2013412132444041 |
6 | 45011023043300 |
7 | 4365050414226 |
oct | 726670777364 |
9 | 201111055130 |
10 | 63197937396 |
11 | 24890651830 |
12 | 102b8a40530 |
13 | 5c62155c39 |
14 | 30b74a2416 |
15 | 199d394bb6 |
hex | eb6e3fef4 |
63197937396 has 96 divisors (see below), whose sum is σ = 179202441600. Its totient is φ = 19101519360.
The previous prime is 63197937343. The next prime is 63197937463. The reversal of 63197937396 is 69373979136.
It is a super-2 number, since 2×631979373962 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 393756 + ... + 530508.
It is an arithmetic number, because the mean of its divisors is an integer number (1866692100).
Almost surely, 263197937396 is an apocalyptic number.
63197937396 is a gapful number since it is divisible by the number (66) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 63197937396, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (89601220800).
63197937396 is an abundant number, since it is smaller than the sum of its proper divisors (116004504204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
63197937396 is a wasteful number, since it uses less digits than its factorization.
63197937396 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137166 (or 137158 counting only the distinct ones).
The product of its digits is 34720812, while the sum is 63.
The spelling of 63197937396 in words is "sixty-three billion, one hundred ninety-seven million, nine hundred thirty-seven thousand, three hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •