Base | Representation |
---|---|
bin | 100100011001001000011001… |
… | …0000111011010110010101111 |
3 | 1112222102112111021211212102010 |
4 | 1020302100302013122302233 |
5 | 313424214111341423043 |
6 | 3052454012330532303 |
7 | 124266266030662623 |
oct | 11062206207326257 |
9 | 1488375437755363 |
10 | 320113343311023 |
11 | 92aa8340a63729 |
12 | 2baa013ab97093 |
13 | 109807357506a2 |
14 | 59097d5cc9183 |
15 | 2701d39098133 |
hex | 12324321dacaf |
320113343311023 has 8 divisors (see below), whose sum is σ = 438353407056688. Its totient is φ = 207641087553024.
The previous prime is 320113343311019. The next prime is 320113343311051.
It is a happy number.
320113343311023 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 320113343311023 - 22 = 320113343311019 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320113343311523) 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 in 7 ways as a sum of consecutive naturals, for example, 1441951996786 + ... + 1441951997007.
It is an arithmetic number, because the mean of its divisors is an integer number (54794175882086).
Almost surely, 2320113343311023 is an apocalyptic number.
320113343311023 is a deficient number, since it is larger than the sum of its proper divisors (118240063745665).
320113343311023 is a wasteful number, since it uses less digits than its factorization.
320113343311023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2883903993833.
The product of its (nonzero) digits is 11664, while the sum is 30.
The spelling of 320113343311023 in words is "three hundred twenty trillion, one hundred thirteen billion, three hundred forty-three million, three hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •