Base | Representation |
---|---|
bin | 11101000110111011001… |
… | …111001001010011110001 |
3 | 21002020010102102102200220 |
4 | 131012323033021103301 |
5 | 230233104040233241 |
6 | 4130531534403253 |
7 | 264342216555264 |
oct | 35067317112361 |
9 | 7066112372626 |
10 | 2000301102321 |
11 | 701360908485 |
12 | 283808960529 |
13 | 116820a59b22 |
14 | 6cb5a86ccdb |
15 | 37074658166 |
hex | 1d1bb3c94f1 |
2000301102321 has 8 divisors (see below), whose sum is σ = 2679708270624. Its totient is φ = 1327214001120.
The previous prime is 2000301102307. The next prime is 2000301102329. The reversal of 2000301102321 is 1232011030002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2000301102321 - 233 = 1991711167729 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2000301102321.
It is not an unprimeable number, because it can be changed into a prime (2000301102329) 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, 1580016036 + ... + 1580017301.
It is an arithmetic number, because the mean of its divisors is an integer number (334963533828).
Almost surely, 22000301102321 is an apocalyptic number.
It is an amenable number.
2000301102321 is a deficient number, since it is larger than the sum of its proper divisors (679407168303).
2000301102321 is a wasteful number, since it uses less digits than its factorization.
2000301102321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3160033551.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 2000301102321 its reverse (1232011030002), we get a palindrome (3232312132323).
The spelling of 2000301102321 in words is "two trillion, three hundred one million, one hundred two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •