Base | Representation |
---|---|
bin | 1011101001001000011… |
… | …1110010100100110001 |
3 | 201010021201221100212011 |
4 | 2322102013302210301 |
5 | 11234120110330223 |
6 | 231515443002521 |
7 | 20310453021013 |
oct | 2722207624461 |
9 | 633251840764 |
10 | 200020011313 |
11 | 77912099a81 |
12 | 32922369441 |
13 | 15b285077a5 |
14 | 9976a101b3 |
15 | 530a0c880d |
hex | 2e921f2931 |
200020011313 has 8 divisors (see below), whose sum is σ = 210359973888. Its totient is φ = 189817002144.
The previous prime is 200020011311. The next prime is 200020011467. The reversal of 200020011313 is 313110020002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200020011313 - 21 = 200020011311 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200020011293 and 200020011302.
It is not an unprimeable number, because it can be changed into a prime (200020011311) 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, 34235356 + ... + 34241197.
It is an arithmetic number, because the mean of its divisors is an integer number (26294996736).
Almost surely, 2200020011313 is an apocalyptic number.
200020011313 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
200020011313 is a deficient number, since it is larger than the sum of its proper divisors (10339962575).
200020011313 is a wasteful number, since it uses less digits than its factorization.
200020011313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68476703.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 200020011313 its reverse (313110020002), we get a palindrome (513130031315).
The spelling of 200020011313 in words is "two hundred billion, twenty million, eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •