Base | Representation |
---|---|
bin | 111101000110011… |
… | …1010011101011011 |
3 | 12021212211020021012 |
4 | 1322030322131123 |
5 | 13144323034111 |
6 | 535235004135 |
7 | 101543313413 |
oct | 17214723533 |
9 | 5255736235 |
10 | 2050205531 |
11 | 962318840 |
12 | 49273964b |
13 | 2689a518a |
14 | 156407643 |
15 | beecd48b |
hex | 7a33a75b |
2050205531 has 8 divisors (see below), whose sum is σ = 2237358000. Its totient is φ = 1863181440.
The previous prime is 2050205503. The next prime is 2050205539. The reversal of 2050205531 is 1355020502.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2050205531 is a prime.
It is a super-2 number, since 2×20502055312 = 8406685438685983922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2050205497 and 2050205506.
It is not an unprimeable number, because it can be changed into a prime (2050205539) 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 7 ways as a sum of consecutive naturals, for example, 2975 + ... + 64103.
It is an arithmetic number, because the mean of its divisors is an integer number (279669750).
Almost surely, 22050205531 is an apocalyptic number.
2050205531 is a deficient number, since it is larger than the sum of its proper divisors (187152469).
2050205531 is a wasteful number, since it uses less digits than its factorization.
2050205531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64189.
The product of its (nonzero) digits is 1500, while the sum is 23.
The square root of 2050205531 is about 45279.1953439988. The cubic root of 2050205531 is about 1270.3765455060.
The spelling of 2050205531 in words is "two billion, fifty million, two hundred five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •