Base | Representation |
---|---|
bin | 11111001011010… |
… | …010100010111101 |
3 | 1100110012212011102 |
4 | 133023102202331 |
5 | 2032400200440 |
6 | 123522502445 |
7 | 15650610401 |
oct | 3713224275 |
9 | 1313185142 |
10 | 523053245 |
11 | 249282710 |
12 | 127204a25 |
13 | 84497180 |
14 | 4d677101 |
15 | 30dbdb15 |
hex | 1f2d28bd |
523053245 has 32 divisors (see below), whose sum is σ = 744799104. Its totient is φ = 347616000.
The previous prime is 523053241. The next prime is 523053313. The reversal of 523053245 is 542350325.
It is not a de Polignac number, because 523053245 - 22 = 523053241 is a prime.
It is a Smith number, since the sum of its digits (29) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (523053241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 68594 + ... + 75836.
It is an arithmetic number, because the mean of its divisors is an integer number (23274972).
Almost surely, 2523053245 is an apocalyptic number.
523053245 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
523053245 is a deficient number, since it is larger than the sum of its proper divisors (221745859).
523053245 is a wasteful number, since it uses less digits than its factorization.
523053245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7373.
The product of its (nonzero) digits is 18000, while the sum is 29.
The square root of 523053245 is about 22870.3573430762. The cubic root of 523053245 is about 805.7159609089.
The spelling of 523053245 in words is "five hundred twenty-three million, fifty-three thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •