Base | Representation |
---|---|
bin | 100100011001110001010001… |
… | …0101010111101101010111001 |
3 | 1112222201221002100220200221020 |
4 | 1020303202202222331222321 |
5 | 313432133404020214113 |
6 | 3053002211402133053 |
7 | 124305524345141151 |
oct | 11063424252755271 |
9 | 1488657070820836 |
10 | 320201131023033 |
11 | 9303159a922037 |
12 | 2bab515aab1189 |
13 | 10988ab612b200 |
14 | 590db6306b761 |
15 | 27042760cc023 |
hex | 12338a2abdab9 |
320201131023033 has 24 divisors (see below), whose sum is σ = 463251510911808. Its totient is φ = 196642236053952.
The previous prime is 320201131023029. The next prime is 320201131023043. The reversal of 320201131023033 is 330320131102023.
It is not a de Polignac number, because 320201131023033 - 22 = 320201131023029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 320201131022994 and 320201131023012.
It is not an unprimeable number, because it can be changed into a prime (320201131023023) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 648172410 + ... + 648666227.
It is an arithmetic number, because the mean of its divisors is an integer number (19302146287992).
Almost surely, 2320201131023033 is an apocalyptic number.
It is an amenable number.
320201131023033 is a deficient number, since it is larger than the sum of its proper divisors (143050379888775).
320201131023033 is a wasteful number, since it uses less digits than its factorization.
320201131023033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1296839153 (or 1296839140 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 320201131023033 its reverse (330320131102023), we get a palindrome (650521262125056).
The spelling of 320201131023033 in words is "three hundred twenty trillion, two hundred one billion, one hundred thirty-one million, twenty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •