Base | Representation |
---|---|
bin | 1100001111000011111… |
… | …0010111100001010001 |
3 | 202002120021211222211100 |
4 | 3003300332113201101 |
5 | 11420443013430223 |
6 | 240322023335013 |
7 | 21120661444260 |
oct | 3036076274121 |
9 | 662507758740 |
10 | 210201311313 |
11 | 811671843a4 |
12 | 348a3bb1469 |
13 | 16a8b932766 |
14 | a260c885d7 |
15 | 5703d4a043 |
hex | 30f0f97851 |
210201311313 has 12 divisors (see below), whose sum is σ = 346998990208. Its totient is φ = 120115035000.
The previous prime is 210201311303. The next prime is 210201311321. The reversal of 210201311313 is 313113102012.
210201311313 is a `hidden beast` number, since 21 + 0 + 20 + 1 + 311 + 313 = 666.
210201311313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 210201311313 - 29 = 210201310801 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210201311303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1668264313 + ... + 1668264438.
Almost surely, 2210201311313 is an apocalyptic number.
It is an amenable number.
210201311313 is a deficient number, since it is larger than the sum of its proper divisors (136797678895).
210201311313 is a wasteful number, since it uses less digits than its factorization.
210201311313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3336528764 (or 3336528761 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 210201311313 its reverse (313113102012), we get a palindrome (523314413325).
The spelling of 210201311313 in words is "two hundred ten billion, two hundred one million, three hundred eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •