Base | Representation |
---|---|
bin | 1011101010011000011… |
… | …0100100010011101011 |
3 | 201011011002201111101011 |
4 | 2322212012210103223 |
5 | 11240311420010201 |
6 | 232013020004351 |
7 | 20321663253466 |
oct | 2724606442353 |
9 | 634132644334 |
10 | 200355235051 |
11 | 77a74341594 |
12 | 329b66906b7 |
13 | 15b7cab912a |
14 | 99a93522dd |
15 | 5329744151 |
hex | 2ea61a44eb |
200355235051 has 4 divisors (see below), whose sum is σ = 200696556312. Its totient is φ = 200013913792.
The previous prime is 200355235013. The next prime is 200355235063. The reversal of 200355235051 is 150532553002.
200355235051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 200355235051 - 211 = 200355233003 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200355230051) 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 3 ways as a sum of consecutive naturals, for example, 170659750 + ... + 170660923.
It is an arithmetic number, because the mean of its divisors is an integer number (50174139078).
Almost surely, 2200355235051 is an apocalyptic number.
200355235051 is a deficient number, since it is larger than the sum of its proper divisors (341321261).
200355235051 is an equidigital number, since it uses as much as digits as its factorization.
200355235051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 341321260.
The product of its (nonzero) digits is 22500, while the sum is 31.
Adding to 200355235051 its reverse (150532553002), we get a palindrome (350887788053).
The spelling of 200355235051 in words is "two hundred billion, three hundred fifty-five million, two hundred thirty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •