Search a number
-
+
321102013 = 59163173193
BaseRepresentation
bin10011001000111…
…010000010111101
3211101012200011011
4103020322002331
51124200231023
651510155221
710646215321
oct2310720275
9741180134
10321102013
11155287771
128b652b11
13516a89bb
1430907981
151d2cb50d
hex1323a0bd

321102013 has 16 divisors (see below), whose sum is σ = 332159040. Its totient is φ = 310293504.

The previous prime is 321101981. The next prime is 321102031. The reversal of 321102013 is 310201123.

It is a cyclic number.

It is not a de Polignac number, because 321102013 - 25 = 321101981 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 321101984 and 321102002.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (321102053) by changing a digit.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1663645 + ... + 1663837.

It is an arithmetic number, because the mean of its divisors is an integer number (20759940).

Almost surely, 2321102013 is an apocalyptic number.

It is an amenable number.

321102013 is a deficient number, since it is larger than the sum of its proper divisors (11057027).

321102013 is a wasteful number, since it uses less digits than its factorization.

321102013 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 588.

The product of its (nonzero) digits is 36, while the sum is 13.

The square root of 321102013 is about 17919.3195462328. The cubic root of 321102013 is about 684.7746522850.

Adding to 321102013 its reverse (310201123), we get a palindrome (631303136).

The spelling of 321102013 in words is "three hundred twenty-one million, one hundred two thousand, thirteen".

Divisors: 1 59 163 173 193 9617 10207 11387 28199 31459 33389 1663741 1856081 1969951 5442407 321102013