Base | Representation |
---|---|
bin | 1011101001010110101… |
… | …1001110101100000001 |
3 | 201010102220010110122110 |
4 | 2322111223032230001 |
5 | 11234230341230103 |
6 | 231525412525533 |
7 | 20312105551431 |
oct | 2722553165401 |
9 | 633386113573 |
10 | 200079633153 |
11 | 77942811824 |
12 | 3293a3208a9 |
13 | 15b3798159a |
14 | 99808d02c1 |
15 | 5310454403 |
hex | 2e95aceb01 |
200079633153 has 4 divisors (see below), whose sum is σ = 266772844208. Its totient is φ = 133386422100.
The previous prime is 200079633139. The next prime is 200079633163. The reversal of 200079633153 is 351336970002.
200079633153 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, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 200079633153 - 213 = 200079624961 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200079633163) 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, 33346605523 + ... + 33346605528.
It is an arithmetic number, because the mean of its divisors is an integer number (66693211052).
Almost surely, 2200079633153 is an apocalyptic number.
It is an amenable number.
200079633153 is a deficient number, since it is larger than the sum of its proper divisors (66693211055).
200079633153 is an equidigital number, since it uses as much as digits as its factorization.
200079633153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66693211054.
The product of its (nonzero) digits is 102060, while the sum is 39.
The spelling of 200079633153 in words is "two hundred billion, seventy-nine million, six hundred thirty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •