Base | Representation |
---|---|
bin | 1011101001000100001… |
… | …1100000100111101111 |
3 | 201010020111020222121000 |
4 | 2322101003200213233 |
5 | 11234101020040413 |
6 | 231514003211343 |
7 | 20310144621252 |
oct | 2722103404757 |
9 | 633214228530 |
10 | 200002111983 |
11 | 77902a83a43 |
12 | 32918376b53 |
13 | 15b248ab57b |
14 | 99744b1099 |
15 | 5308740073 |
hex | 2e910e09ef |
200002111983 has 32 divisors (see below), whose sum is σ = 301263217920. Its totient is φ = 131108202720.
The previous prime is 200002111951. The next prime is 200002112003. The reversal of 200002111983 is 389111200002.
200002111983 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 200002111983 - 25 = 200002111951 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200002111483) 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 31 ways as a sum of consecutive naturals, for example, 908368 + ... + 1106858.
It is an arithmetic number, because the mean of its divisors is an integer number (9414475560).
Almost surely, 2200002111983 is an apocalyptic number.
200002111983 is a deficient number, since it is larger than the sum of its proper divisors (101261105937).
200002111983 is a wasteful number, since it uses less digits than its factorization.
200002111983 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 199124 (or 199118 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 27.
Adding to 200002111983 its reverse (389111200002), we get a palindrome (589113311985).
The spelling of 200002111983 in words is "two hundred billion, two million, one hundred eleven thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •