Base | Representation |
---|---|
bin | 111111010100111000… |
… | …010110001001010000 |
3 | 20111111202120020021020 |
4 | 333110320112021100 |
5 | 2103223442100000 |
6 | 51123103155440 |
7 | 4625001613554 |
oct | 772470261120 |
9 | 214452506236 |
10 | 67996050000 |
11 | 26922aa784a |
12 | 112178a5b80 |
13 | 6548219418 |
14 | 341080d864 |
15 | 1b7e71cba0 |
hex | fd4e16250 |
67996050000 has 240 divisors, whose sum is σ = 229114085760. Its totient is φ = 17343040000.
The previous prime is 67996049983. The next prime is 67996050011. The reversal of 67996050000 is 5069976.
It is a tau number, because it is divible by the number of its divisors (240).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3440146 + ... + 3459854.
It is an arithmetic number, because the mean of its divisors is an integer number (954642024).
Almost surely, 267996050000 is an apocalyptic number.
67996050000 is a gapful number since it is divisible by the number (60) 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 67996050000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (114557042880).
67996050000 is an abundant number, since it is smaller than the sum of its proper divisors (161118035760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67996050000 is a wasteful number, since it uses less digits than its factorization.
67996050000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19768 (or 19742 counting only the distinct ones).
The product of its (nonzero) digits is 102060, while the sum is 42.
The spelling of 67996050000 in words is "sixty-seven billion, nine hundred ninety-six million, fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •