Base | Representation |
---|---|
bin | 10011100100001… |
… | …111110011111101 |
3 | 211212200210111002 |
4 | 103210033303331 |
5 | 1133014102203 |
6 | 52323540045 |
7 | 11064145430 |
oct | 2344176375 |
9 | 755623432 |
10 | 328269053 |
11 | 159332442 |
12 | 91b2a625 |
13 | 53017c58 |
14 | 31851817 |
15 | 1dc44d88 |
hex | 1390fcfd |
328269053 has 4 divisors (see below), whose sum is σ = 375164640. Its totient is φ = 281373468.
The previous prime is 328269043. The next prime is 328269059. The reversal of 328269053 is 350962823.
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, and also an emirpimes, since its reverse is a distinct semiprime: 350962823 = 1153 ⋅304391.
It is a cyclic number.
It is not a de Polignac number, because 328269053 - 216 = 328203517 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 328268998 and 328269016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (328269059) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23447783 + ... + 23447796.
It is an arithmetic number, because the mean of its divisors is an integer number (93791160).
Almost surely, 2328269053 is an apocalyptic number.
It is an amenable number.
328269053 is a deficient number, since it is larger than the sum of its proper divisors (46895587).
328269053 is an equidigital number, since it uses as much as digits as its factorization.
328269053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46895586.
The product of its (nonzero) digits is 77760, while the sum is 38.
The square root of 328269053 is about 18118.1967369824. The cubic root of 328269053 is about 689.8319642626.
The spelling of 328269053 in words is "three hundred twenty-eight million, two hundred sixty-nine thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •