Search a number
-
+
323121020121323 = 1133575979965269
BaseRepresentation
bin100100101111000000111100…
…1100111111011000011101011
31120101002001211110101111211122
41021132001321213323003223
5314323003322122340243
63103115425235045455
7125026503046025114
oct11136017147730353
91511061743344748
10323121020121323
1193a57945124626
12302a7027a4088b
1310b3b248866698
1459b11d859b20b
1527551bc747668
hex125e0799fb0eb

323121020121323 has 8 divisors (see below), whose sum is σ = 325989618292800. Its totient is φ = 320252581952128.

The previous prime is 323121020121241. The next prime is 323121020121343.

323121020121323 is nontrivially palindromic in base 10.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 323121020121323 - 222 = 323121015927019 is a prime.

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35941868 + ... + 44023401.

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

Almost surely, 2323121020121323 is an apocalyptic number.

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

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

323121020121323 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 80001141.

The product of its (nonzero) digits is 2592, while the sum is 26.

The spelling of 323121020121323 in words is "three hundred twenty-three trillion, one hundred twenty-one billion, twenty million, one hundred twenty-one thousand, three hundred twenty-three".

Divisors: 1 113 35759 4040767 79965269 9036075397 2859478054171 323121020121323