Base | Representation |
---|---|
bin | 11101001000110010100… |
… | …000101110110111010101 |
3 | 21002102021212211210102221 |
4 | 131020302200232313111 |
5 | 230301203330420201 |
6 | 4131502301102341 |
7 | 264442625615143 |
oct | 35106240566725 |
9 | 7072255753387 |
10 | 2002302201301 |
11 | 702198435796 |
12 | 284086b579b1 |
13 | 116a7c4ca46c |
14 | 6ccaa532593 |
15 | 371401864a1 |
hex | 1d23282edd5 |
2002302201301 has 8 divisors (see below), whose sum is σ = 2041907941944. Its totient is φ = 1962764107200.
The previous prime is 2002302201299. The next prime is 2002302201313. The reversal of 2002302201301 is 1031022032002.
It can be written as a sum of positive squares in 4 ways, for example, as 448973703025 + 1553328498276 = 670055^2 + 1246326^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2002302201301 - 21 = 2002302201299 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 (2002302201331) 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, 16851850 + ... + 16970251.
It is an arithmetic number, because the mean of its divisors is an integer number (255238492743).
Almost surely, 22002302201301 is an apocalyptic number.
It is an amenable number.
2002302201301 is a deficient number, since it is larger than the sum of its proper divisors (39605740643).
2002302201301 is a wasteful number, since it uses less digits than its factorization.
2002302201301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33823271.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 2002302201301 its reverse (1031022032002), we get a palindrome (3033324233303).
The spelling of 2002302201301 in words is "two trillion, two billion, three hundred two million, two hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •