Base | Representation |
---|---|
bin | 101110000011011111100001… |
… | …110000001111110001000001 |
3 | 222120011121100020012102112201 |
4 | 232003133201300033301001 |
5 | 203022040201424430103 |
6 | 1554442130543153201 |
7 | 60443523354535432 |
oct | 5603374160176101 |
9 | 876147306172481 |
10 | 202550150233153 |
11 | 595a2044376008 |
12 | 1a8736ab5a5801 |
13 | 8903521891a98 |
14 | 380369dd73489 |
15 | 1863bda81d51d |
hex | b837e1c0fc41 |
202550150233153 has 4 divisors (see below), whose sum is σ = 202550182838320. Its totient is φ = 202550117627988.
The previous prime is 202550150233091. The next prime is 202550150233159. The reversal of 202550150233153 is 351332051055202.
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 a cyclic number.
It is not a de Polignac number, because 202550150233153 - 29 = 202550150232641 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202550150233159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3775743 + ... + 20478196.
It is an arithmetic number, because the mean of its divisors is an integer number (50637545709580).
Almost surely, 2202550150233153 is an apocalyptic number.
It is an amenable number.
202550150233153 is a deficient number, since it is larger than the sum of its proper divisors (32605167).
202550150233153 is an equidigital number, since it uses as much as digits as its factorization.
202550150233153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32605166.
The product of its (nonzero) digits is 135000, while the sum is 37.
The spelling of 202550150233153 in words is "two hundred two trillion, five hundred fifty billion, one hundred fifty million, two hundred thirty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •