Base | Representation |
---|---|
bin | 101101110001010011010000… |
… | …001011110111101000110011 |
3 | 222101202002112111121200110121 |
4 | 231301103100023313220303 |
5 | 202341044420110020311 |
6 | 1552043541425511111 |
7 | 60254306103102136 |
oct | 5561232013675063 |
9 | 871662474550417 |
10 | 201300020001331 |
11 | 5915a94a456869 |
12 | 1a6b13614a2497 |
13 | 884268356a214 |
14 | 379cd89ad821d |
15 | 184141eb15b71 |
hex | b714d02f7a33 |
201300020001331 has 8 divisors (see below), whose sum is σ = 207806168456064. Its totient is φ = 194794659010560.
The previous prime is 201300020001313. The next prime is 201300020001347. The reversal of 201300020001331 is 133100020003102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201300020001331 - 221 = 201300017904179 is a prime.
It is a super-2 number, since 2×2013000200013312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201300020001631) 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, 196346446 + ... + 197369011.
It is an arithmetic number, because the mean of its divisors is an integer number (25975771057008).
Almost surely, 2201300020001331 is an apocalyptic number.
201300020001331 is a deficient number, since it is larger than the sum of its proper divisors (6506148454733).
201300020001331 is a wasteful number, since it uses less digits than its factorization.
201300020001331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 393731981.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 201300020001331 its reverse (133100020003102), we get a palindrome (334400040004433).
The spelling of 201300020001331 in words is "two hundred one trillion, three hundred billion, twenty million, one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •