Base | Representation |
---|---|
bin | 1001010110000111101… |
… | …01101110001110110111 |
3 | 1010200211221011201210002 |
4 | 10223003311232032313 |
5 | 20230114441020043 |
6 | 403303430421515 |
7 | 32125325222561 |
oct | 4530365561667 |
9 | 1120757151702 |
10 | 321113220023 |
11 | 11420204aa72 |
12 | 5229820189b |
13 | 243860355cb |
14 | 11783208331 |
15 | 8546022bb8 |
hex | 4ac3d6e3b7 |
321113220023 has 2 divisors, whose sum is σ = 321113220024. Its totient is φ = 321113220022.
The previous prime is 321113220011. The next prime is 321113220079. The reversal of 321113220023 is 320022311123.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 321113220023 - 228 = 320844784567 is a prime.
It is a super-3 number, since 3×3211132200233 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 321113219977 and 321113220004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (321113220083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160556610011 + 160556610012.
It is an arithmetic number, because the mean of its divisors is an integer number (160556610012).
Almost surely, 2321113220023 is an apocalyptic number.
321113220023 is a deficient number, since it is larger than the sum of its proper divisors (1).
321113220023 is an equidigital number, since it uses as much as digits as its factorization.
321113220023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 321113220023 its reverse (320022311123), we get a palindrome (641135531146).
The spelling of 321113220023 in words is "three hundred twenty-one billion, one hundred thirteen million, two hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •