Base | Representation |
---|---|
bin | 1111111110011… |
… | …0101011011110 |
3 | 11200002012210020 |
4 | 3333212223132 |
5 | 114123131100 |
6 | 10352053010 |
7 | 1442351202 |
oct | 377465336 |
9 | 150065706 |
10 | 67005150 |
11 | 34905a63 |
12 | 1a534166 |
13 | 10b60624 |
14 | 8c82b02 |
15 | 5d385a0 |
hex | 3fe6ade |
67005150 has 48 divisors (see below), whose sum is σ = 170678064. Its totient is φ = 17383680.
The previous prime is 67005131. The next prime is 67005157. The reversal of 67005150 is 5150076.
It is a self number, because there is not a number n which added to its sum of digits gives 67005150.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (67005157) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 487 + ... + 11586.
It is an arithmetic number, because the mean of its divisors is an integer number (3555793).
Almost surely, 267005150 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 67005150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85339032).
67005150 is an abundant number, since it is smaller than the sum of its proper divisors (103672914).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67005150 is a wasteful number, since it uses less digits than its factorization.
67005150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12125 (or 12120 counting only the distinct ones).
The product of its (nonzero) digits is 1050, while the sum is 24.
The square root of 67005150 is about 8185.6673521467. The cubic root of 67005150 is about 406.1652162320.
The spelling of 67005150 in words is "sixty-seven million, five thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •