Base | Representation |
---|---|
bin | 1011101001110010100… |
… | …0010011011110101111 |
3 | 201010202000200002212222 |
4 | 2322130220103132233 |
5 | 11240000223304423 |
6 | 231545141345555 |
7 | 20315023350140 |
oct | 2723450233657 |
9 | 633660602788 |
10 | 200196306863 |
11 | 779a2661483 |
12 | 329714082bb |
13 | 15b55bb2497 |
14 | 99921c1ac7 |
15 | 531a7ee3c8 |
hex | 2e9ca137af |
200196306863 has 8 divisors (see below), whose sum is σ = 228811405728. Its totient is φ = 171585114624.
The previous prime is 200196306839. The next prime is 200196306887. The reversal of 200196306863 is 368603691002.
It is an interprime number because it is at equal distance from previous prime (200196306839) and next prime (200196306887).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200196306863 - 26 = 200196306799 is a prime.
It is a super-2 number, since 2×2001963068632 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200196306823) 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, 866006 + ... + 1072547.
It is an arithmetic number, because the mean of its divisors is an integer number (28601425716).
Almost surely, 2200196306863 is an apocalyptic number.
200196306863 is a deficient number, since it is larger than the sum of its proper divisors (28615098865).
200196306863 is a wasteful number, since it uses less digits than its factorization.
200196306863 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1953313.
The product of its (nonzero) digits is 279936, while the sum is 44.
Adding to 200196306863 its reverse (368603691002), we get a palindrome (568799997865).
The spelling of 200196306863 in words is "two hundred billion, one hundred ninety-six million, three hundred six thousand, eight hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •