Base | Representation |
---|---|
bin | 101101100010111100000001… |
… | …110011100011100010111101 |
3 | 222021020201220002012002022220 |
4 | 231202330001303203202331 |
5 | 202223412021030312201 |
6 | 1550010305412155553 |
7 | 60123065060436306 |
oct | 5542740163434275 |
9 | 867221802162286 |
10 | 200313010010301 |
11 | 5890a2a8001981 |
12 | 1a572005908bb9 |
13 | 87a0588585926 |
14 | 37672b69797ad |
15 | 18259039cb036 |
hex | b62f01ce38bd |
200313010010301 has 8 divisors (see below), whose sum is σ = 276293806910880. Its totient is φ = 128937109891632.
The previous prime is 200313010010149. The next prime is 200313010010357. The reversal of 200313010010301 is 103010010313002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200313010010301 - 233 = 200304420075709 is a prime.
It is a super-2 number, since 2×2003130100103012 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200313010010381) 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, 1151224195375 + ... + 1151224195548.
It is an arithmetic number, because the mean of its divisors is an integer number (34536725863860).
Almost surely, 2200313010010301 is an apocalyptic number.
It is an amenable number.
200313010010301 is a deficient number, since it is larger than the sum of its proper divisors (75980796900579).
200313010010301 is a wasteful number, since it uses less digits than its factorization.
200313010010301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2302448390955.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 200313010010301 its reverse (103010010313002), we get a palindrome (303323020323303).
The spelling of 200313010010301 in words is "two hundred trillion, three hundred thirteen billion, ten million, ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •