Base | Representation |
---|---|
bin | 1000000000000… |
… | …01100010001110 |
3 | 11200021210200022 |
4 | 10000001202032 |
5 | 114140141100 |
6 | 10354302142 |
7 | 1443316664 |
oct | 400014216 |
9 | 150253608 |
10 | 67115150 |
11 | 34980673 |
12 | 1a587952 |
13 | 10b9b70b |
14 | 8cb0c34 |
15 | 5d5ae85 |
hex | 400188e |
67115150 has 48 divisors (see below), whose sum is σ = 137964384. Its totient is φ = 24161280.
The previous prime is 67115149. The next prime is 67115159. The reversal of 67115150 is 5151176.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (67115159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17834 + ... + 21266.
It is an arithmetic number, because the mean of its divisors is an integer number (2874258).
Almost surely, 267115150 is an apocalyptic number.
67115150 is an abundant number, since it is smaller than the sum of its proper divisors (70849234).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67115150 is a wasteful number, since it uses less digits than its factorization.
67115150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3485 (or 3480 counting only the distinct ones).
The product of its (nonzero) digits is 1050, while the sum is 26.
The square root of 67115150 is about 8192.3836580082. The cubic root of 67115150 is about 406.3873571033.
The spelling of 67115150 in words is "sixty-seven million, one hundred fifteen thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •