Base | Representation |
---|---|
bin | 101101101100111101110010… |
… | …110010000001001101111001 |
3 | 222100200121112221221201021020 |
4 | 231230331302302001031321 |
5 | 202321204300122402223 |
6 | 1551255031242333053 |
7 | 60223631264423526 |
oct | 5554756262011571 |
9 | 870617487851236 |
10 | 201002100200313 |
11 | 5905556a4a3885 |
12 | 1a6636787ba189 |
13 | 88205556b57a9 |
14 | 378c7a6d6a14d |
15 | 18387d4dac1e3 |
hex | b6cf72c81379 |
201002100200313 has 8 divisors (see below), whose sum is σ = 268003211820288. Its totient is φ = 134001194356944.
The previous prime is 201002100200287. The next prime is 201002100200353. The reversal of 201002100200313 is 313002001200102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201002100200313 - 26 = 201002100200249 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201002100200292 and 201002100200301.
It is not an unprimeable number, because it can be changed into a prime (201002100200353) 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, 49150345 + ... + 53082582.
It is an arithmetic number, because the mean of its divisors is an integer number (33500401477536).
Almost surely, 2201002100200313 is an apocalyptic number.
It is an amenable number.
201002100200313 is a deficient number, since it is larger than the sum of its proper divisors (67001111619975).
201002100200313 is a wasteful number, since it uses less digits than its factorization.
201002100200313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102888303.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 201002100200313 its reverse (313002001200102), we get a palindrome (514004101400415).
The spelling of 201002100200313 in words is "two hundred one trillion, two billion, one hundred million, two hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •