Base | Representation |
---|---|
bin | 10100011101101… |
… | …011100111100000 |
3 | 212221000201120101 |
4 | 110131223213200 |
5 | 1200342401102 |
6 | 54022352144 |
7 | 11336133652 |
oct | 2435534740 |
9 | 787021511 |
10 | 343325152 |
11 | 1668862a5 |
12 | 96b8b654 |
13 | 56189ca1 |
14 | 338506d2 |
15 | 2021ae87 |
hex | 1476b9e0 |
343325152 has 48 divisors (see below), whose sum is σ = 695036160. Its totient is φ = 166877568.
The previous prime is 343325131. The next prime is 343325221. The reversal of 343325152 is 251523343.
343325152 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 343325152.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 168363 + ... + 170389.
It is an arithmetic number, because the mean of its divisors is an integer number (14479920).
Almost surely, 2343325152 is an apocalyptic number.
343325152 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
343325152 is an abundant number, since it is smaller than the sum of its proper divisors (351711008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
343325152 is a wasteful number, since it uses less digits than its factorization.
343325152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2183 (or 2175 counting only the distinct ones).
The product of its digits is 10800, while the sum is 28.
The square root of 343325152 is about 18529.0353769429. The cubic root of 343325152 is about 700.2211219795.
Adding to 343325152 its reverse (251523343), we get a palindrome (594848495).
The spelling of 343325152 in words is "three hundred forty-three million, three hundred twenty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •