Base | Representation |
---|---|
bin | 100001110000110010101… |
… | …110010001010101111101 |
3 | 22012210200002012000202020 |
4 | 201300302232101111331 |
5 | 301003113113032201 |
6 | 4533504325150353 |
7 | 326424031625403 |
oct | 41606256212575 |
9 | 8183602160666 |
10 | 2320133330301 |
11 | 814a65863136 |
12 | 3157a7b5b3b9 |
13 | 13aa31581177 |
14 | 8041b8a3473 |
15 | 40542e92a36 |
hex | 21c32b9157d |
2320133330301 has 8 divisors (see below), whose sum is σ = 3228011590080. Its totient is φ = 1479505312032.
The previous prime is 2320133330297. The next prime is 2320133330323. The reversal of 2320133330301 is 1030333310232.
2320133330301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2320133330301 - 22 = 2320133330297 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2320133330101) 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, 16812560296 + ... + 16812560433.
It is an arithmetic number, because the mean of its divisors is an integer number (403501448760).
Almost surely, 22320133330301 is an apocalyptic number.
It is an amenable number.
2320133330301 is a deficient number, since it is larger than the sum of its proper divisors (907878259779).
2320133330301 is a wasteful number, since it uses less digits than its factorization.
2320133330301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33625120755.
The product of its (nonzero) digits is 2916, while the sum is 24.
Adding to 2320133330301 its reverse (1030333310232), we get a palindrome (3350466640533).
The spelling of 2320133330301 in words is "two trillion, three hundred twenty billion, one hundred thirty-three million, three hundred thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •