Base | Representation |
---|---|
bin | 101101110001010011010000… |
… | …001011110111101000110101 |
3 | 222101202002112111121200110200 |
4 | 231301103100023313220311 |
5 | 202341044420110020313 |
6 | 1552043541425511113 |
7 | 60254306103102141 |
oct | 5561232013675065 |
9 | 871662474550420 |
10 | 201300020001333 |
11 | 5915a94a456870 |
12 | 1a6b13614a2499 |
13 | 884268356a216 |
14 | 379cd89ad8221 |
15 | 184141eb15b73 |
hex | b714d02f7a35 |
201300020001333 has 48 divisors (see below), whose sum is σ = 335624795338560. Its totient is φ = 114980103936000.
The previous prime is 201300020001313. The next prime is 201300020001347. The reversal of 201300020001333 is 333100020003102.
201300020001333 is a `hidden beast` number, since 2 + 0 + 130 + 0 + 0 + 200 + 0 + 1 + 333 = 666.
It is not a de Polignac number, because 201300020001333 - 237 = 201162581047861 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201300020001313) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 276884518 + ... + 277610583.
It is an arithmetic number, because the mean of its divisors is an integer number (6992183236220).
Almost surely, 2201300020001333 is an apocalyptic number.
It is an amenable number.
201300020001333 is a deficient number, since it is larger than the sum of its proper divisors (134324775337227).
201300020001333 is a wasteful number, since it uses less digits than its factorization.
201300020001333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 554495330 (or 554495327 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 201300020001333 its reverse (333100020003102), we get a palindrome (534400040004435).
The spelling of 201300020001333 in words is "two hundred one trillion, three hundred billion, twenty million, one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •