Base | Representation |
---|---|
bin | 1000000111111… |
… | …10010111010000 |
3 | 11202020102020100 |
4 | 10003332113100 |
5 | 114421310421 |
6 | 10432412400 |
7 | 1455162123 |
oct | 403762720 |
9 | 152212210 |
10 | 68150736 |
11 | 35518725 |
12 | 1a9a7100 |
13 | 11171ba4 |
14 | 90a03ba |
15 | 5eb2c26 |
hex | 40fe5d0 |
68150736 has 60 divisors (see below), whose sum is σ = 191342788. Its totient is φ = 22643712.
The previous prime is 68150689. The next prime is 68150737. The reversal of 68150736 is 63705186.
It can be written as a sum of positive squares in 2 ways, for example, as 41525136 + 26625600 = 6444^2 + 5160^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 68150736.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68150737) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 61806 + ... + 62898.
Almost surely, 268150736 is an apocalyptic number.
It is an amenable number.
68150736 is an abundant number, since it is smaller than the sum of its proper divisors (123192052).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68150736 is a wasteful number, since it uses less digits than its factorization.
68150736 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1540 (or 1531 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
The square root of 68150736 is about 8255.3459043216. The cubic root of 68150736 is about 408.4668819130.
It can be divided in two parts, 68150 and 736, that added together give a palindrome (68886).
The spelling of 68150736 in words is "sixty-eight million, one hundred fifty thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.002 sec. • engine limits •