Base | Representation |
---|---|
bin | 10010101101111001011… |
… | …01000101100110000000 |
3 | 2021110222212022222222022 |
4 | 21112330231011212000 |
5 | 41014100203004404 |
6 | 1211235441101012 |
7 | 64315005224624 |
oct | 11267455054600 |
9 | 2243885288868 |
10 | 643116063104 |
11 | 2288202849a9 |
12 | a4782327768 |
13 | 48851470298 |
14 | 231ac62b184 |
15 | 11ae01c28be |
hex | 95bcb45980 |
643116063104 has 64 divisors (see below), whose sum is σ = 1303744150800. Its totient is φ = 315908720640.
The previous prime is 643116063091. The next prime is 643116063173. The reversal of 643116063104 is 401360611346.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×6431160631042 (a number of 24 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 7 ways as a sum of consecutive naturals, for example, 12336614 + ... + 12388634.
Almost surely, 2643116063104 is an apocalyptic number.
643116063104 is a gapful number since it is divisible by the number (64) 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 643116063104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (651872075400).
643116063104 is an abundant number, since it is smaller than the sum of its proper divisors (660628087696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
643116063104 is a wasteful number, since it uses less digits than its factorization.
643116063104 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53731 (or 53719 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 35.
The spelling of 643116063104 in words is "six hundred forty-three billion, one hundred sixteen million, sixty-three thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •