Base | Representation |
---|---|
bin | 100000000010110110… |
… | …0111100000010000000 |
3 | 20120121211211110200111 |
4 | 1000011230330002000 |
5 | 2111413134034130 |
6 | 51340243201104 |
7 | 4654206031120 |
oct | 1000554740200 |
9 | 216554743614 |
10 | 68815143040 |
11 | 27203399546 |
12 | 11406076194 |
13 | 6648b25967 |
14 | 348b508c80 |
15 | 1bcb5b702a |
hex | 1005b3c080 |
68815143040 has 256 divisors, whose sum is σ = 192017203200. Its totient is φ = 23096586240.
The previous prime is 68815143017. The next prime is 68815143113. The reversal of 68815143040 is 4034151886.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a junction number, because it is equal to n+sod(n) for n = 68815142984 and 68815143002.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 44947075 + ... + 44948605.
It is an arithmetic number, because the mean of its divisors is an integer number (750067200).
Almost surely, 268815143040 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 68815143040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (96008601600).
68815143040 is an abundant number, since it is smaller than the sum of its proper divisors (123202060160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68815143040 is a wasteful number, since it uses less digits than its factorization.
68815143040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1763 (or 1751 counting only the distinct ones).
The product of its (nonzero) digits is 92160, while the sum is 40.
The spelling of 68815143040 in words is "sixty-eight billion, eight hundred fifteen million, one hundred forty-three thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •