Base | Representation |
---|---|
bin | 10011100101000… |
… | …001010111001101 |
3 | 211220002002220010 |
4 | 103211001113031 |
5 | 1133042101023 |
6 | 52332143433 |
7 | 11065652232 |
oct | 2345012715 |
9 | 756062803 |
10 | 328472013 |
11 | 159460981 |
12 | 92007b79 |
13 | 5308944c |
14 | 318a5789 |
15 | 1dc85093 |
hex | 139415cd |
328472013 has 4 divisors (see below), whose sum is σ = 437962688. Its totient is φ = 218981340.
The previous prime is 328471999. The next prime is 328472021. The reversal of 328472013 is 310274823.
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: 310274823 = 3 ⋅103424941.
It is not a de Polignac number, because 328472013 - 221 = 326374861 is a prime.
It is a super-3 number, since 3×3284720133 (a number of 27 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (328472093) 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, 54745333 + ... + 54745338.
It is an arithmetic number, because the mean of its divisors is an integer number (109490672).
Almost surely, 2328472013 is an apocalyptic number.
It is an amenable number.
328472013 is a deficient number, since it is larger than the sum of its proper divisors (109490675).
328472013 is a wasteful number, since it uses less digits than its factorization.
328472013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 109490674.
The product of its (nonzero) digits is 8064, while the sum is 30.
The square root of 328472013 is about 18123.7968704132. The cubic root of 328472013 is about 689.9741032079.
The spelling of 328472013 in words is "three hundred twenty-eight million, four hundred seventy-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •