Base | Representation |
---|---|
bin | 10100100110000… |
… | …100011101010101 |
3 | 220002011102220011 |
4 | 110212010131111 |
5 | 1201423232203 |
6 | 54141440221 |
7 | 11363622520 |
oct | 2446043525 |
9 | 802142804 |
10 | 345524053 |
11 | 168048376 |
12 | 97870071 |
13 | 56779b04 |
14 | 33c63bb7 |
15 | 2050276d |
hex | 14984755 |
345524053 has 4 divisors (see below), whose sum is σ = 394884640. Its totient is φ = 296163468.
The previous prime is 345524033. The next prime is 345524057. The reversal of 345524053 is 350425543.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 345524053 - 25 = 345524021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (345524057) 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 3 ways as a sum of consecutive naturals, for example, 24680283 + ... + 24680296.
It is an arithmetic number, because the mean of its divisors is an integer number (98721160).
Almost surely, 2345524053 is an apocalyptic number.
It is an amenable number.
345524053 is a deficient number, since it is larger than the sum of its proper divisors (49360587).
345524053 is an equidigital number, since it uses as much as digits as its factorization.
345524053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49360586.
The product of its (nonzero) digits is 36000, while the sum is 31.
The square root of 345524053 is about 18588.2773004924. The cubic root of 345524053 is about 701.7128482257.
Adding to 345524053 its reverse (350425543), we get a palindrome (695949596).
The spelling of 345524053 in words is "three hundred forty-five million, five hundred twenty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •