Base | Representation |
---|---|
bin | 1001010100011010111… |
… | …11000100110000101011 |
3 | 1010121111101021001221212 |
4 | 10222031133010300223 |
5 | 20221233014011243 |
6 | 403033133223335 |
7 | 32063613153503 |
oct | 4521537046053 |
9 | 1117441231855 |
10 | 320201313323 |
11 | 113884325a71 |
12 | 52082931b4b |
13 | 2426c130548 |
14 | 116d806ca03 |
15 | 84e0e43318 |
hex | 4a8d7c4c2b |
320201313323 has 4 divisors (see below), whose sum is σ = 320226544680. Its totient is φ = 320176081968.
The previous prime is 320201313283. The next prime is 320201313329. The reversal of 320201313323 is 323313102023.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 323313102023 = 197 ⋅1641183259.
It is a cyclic number.
It is not a de Polignac number, because 320201313323 - 218 = 320201051179 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (320201313329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12596633 + ... + 12622026.
It is an arithmetic number, because the mean of its divisors is an integer number (80056636170).
Almost surely, 2320201313323 is an apocalyptic number.
320201313323 is a deficient number, since it is larger than the sum of its proper divisors (25231357).
320201313323 is a wasteful number, since it uses less digits than its factorization.
320201313323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25231356.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 320201313323 its reverse (323313102023), we get a palindrome (643514415346).
The spelling of 320201313323 in words is "three hundred twenty billion, two hundred one million, three hundred thirteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •