Base | Representation |
---|---|
bin | 1000000100010… |
… | …10011100101110 |
3 | 11201100021221200 |
4 | 10002022130232 |
5 | 114311112300 |
6 | 10414310330 |
7 | 1451143656 |
oct | 402123456 |
9 | 151307850 |
10 | 67675950 |
11 | 35223a41 |
12 | 1a7b83a6 |
13 | 11036a54 |
14 | 8db9366 |
15 | 5e1c200 |
hex | 408a72e |
67675950 has 72 divisors (see below), whose sum is σ = 184977000. Its totient is φ = 17734080.
The previous prime is 67675939. The next prime is 67675973. The reversal of 67675950 is 5957676.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a junction number, because it is equal to n+sod(n) for n = 67675896 and 67675905.
It is a congruent number.
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 35 ways as a sum of consecutive naturals, for example, 25276 + ... + 27824.
It is an arithmetic number, because the mean of its divisors is an integer number (2569125).
Almost surely, 267675950 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 67675950, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (92488500).
67675950 is an abundant number, since it is smaller than the sum of its proper divisors (117301050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67675950 is a wasteful number, since it uses less digits than its factorization.
67675950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2626 (or 2618 counting only the distinct ones).
The product of its (nonzero) digits is 396900, while the sum is 45.
The square root of 67675950 is about 8226.5393696256. The cubic root of 67675950 is about 407.5161146349.
The spelling of 67675950 in words is "sixty-seven million, six hundred seventy-five thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •