Base | Representation |
---|---|
bin | 10100010011000… |
… | …011100100011000 |
3 | 212201210012121110 |
4 | 110103003210120 |
5 | 1144134232142 |
6 | 53442540320 |
7 | 11303353014 |
oct | 2423034430 |
9 | 781705543 |
10 | 340539672 |
11 | 165253550 |
12 | 960676a0 |
13 | 55723185 |
14 | 33327544 |
15 | 1ed6a99c |
hex | 144c3918 |
340539672 has 64 divisors (see below), whose sum is σ = 930787200. Its totient is φ = 102967040.
The previous prime is 340539623. The next prime is 340539697. The reversal of 340539672 is 276935043.
It is a self number, because there is not a number n which added to its sum of digits gives 340539672.
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 15 ways as a sum of consecutive naturals, for example, 149083 + ... + 151349.
It is an arithmetic number, because the mean of its divisors is an integer number (14543550).
Almost surely, 2340539672 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 340539672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (465393600).
340539672 is an abundant number, since it is smaller than the sum of its proper divisors (590247528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
340539672 is a wasteful number, since it uses less digits than its factorization.
340539672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2856 (or 2852 counting only the distinct ones).
The product of its (nonzero) digits is 136080, while the sum is 39.
The square root of 340539672 is about 18453.7170239494. The cubic root of 340539672 is about 698.3222896784.
The spelling of 340539672 in words is "three hundred forty million, five hundred thirty-nine thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •