Base | Representation |
---|---|
bin | 10011010111111… |
… | …111100000010101 |
3 | 211122122120201212 |
4 | 103113333200111 |
5 | 1131203302113 |
6 | 52131031205 |
7 | 11024635454 |
oct | 2327774025 |
9 | 748576655 |
10 | 325056533 |
11 | 15753886a |
12 | 90a3b505 |
13 | 52461959 |
14 | 31256b9b |
15 | 1d80d0a8 |
hex | 135ff815 |
325056533 has 4 divisors (see below), whose sum is σ = 325610880. Its totient is φ = 324502188.
The previous prime is 325056527. The next prime is 325056553. The reversal of 325056533 is 335650523.
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 325056533 - 210 = 325055509 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 325056533.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (325056553) 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 3 ways as a sum of consecutive naturals, for example, 276293 + ... + 277466.
It is an arithmetic number, because the mean of its divisors is an integer number (81402720).
Almost surely, 2325056533 is an apocalyptic number.
It is an amenable number.
325056533 is a deficient number, since it is larger than the sum of its proper divisors (554347).
325056533 is an equidigital number, since it uses as much as digits as its factorization.
325056533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 554346.
The product of its (nonzero) digits is 40500, while the sum is 32.
The square root of 325056533 is about 18029.3242524505. The cubic root of 325056533 is about 687.5742962352.
The spelling of 325056533 in words is "three hundred twenty-five million, fifty-six thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •