Base | Representation |
---|---|
bin | 10010101100111101010… |
… | …10011110010101000000 |
3 | 2021102200201222001202101 |
4 | 21112132222132111000 |
5 | 41012032141432004 |
6 | 1211113434400144 |
7 | 64266345253330 |
oct | 11263652362500 |
9 | 2242621861671 |
10 | 642612061504 |
11 | 228591835056 |
12 | a4661590054 |
13 | 487a0c1699a |
14 | 231617130c0 |
15 | 11ab0d18ba4 |
hex | 959ea9e540 |
642612061504 has 224 divisors, whose sum is σ = 1558488729600. Its totient is φ = 256957409280.
The previous prime is 642612061489. The next prime is 642612061513. The reversal of 642612061504 is 405160216246.
It is a tau number, because it is divible by the number of its divisors (224).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 79635582 + ... + 79643650.
Almost surely, 2642612061504 is an apocalyptic number.
642612061504 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 642612061504, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (779244364800).
642612061504 is an abundant number, since it is smaller than the sum of its proper divisors (915876668096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
642612061504 is a wasteful number, since it uses less digits than its factorization.
642612061504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8301 (or 8291 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 37.
The spelling of 642612061504 in words is "six hundred forty-two billion, six hundred twelve million, sixty-one thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •