Base | Representation |
---|---|
bin | 1011101101010101111… |
… | …0110101011001010011 |
3 | 201020012111110010021202 |
4 | 2323111132311121103 |
5 | 11243423413010101 |
6 | 232223533141415 |
7 | 20350454600006 |
oct | 2732536653123 |
9 | 636174403252 |
10 | 201150125651 |
11 | 78342002672 |
12 | 32b9892a86b |
13 | 15c786a04b7 |
14 | 9a42b4b53d |
15 | 537440c36b |
hex | 2ed57b5653 |
201150125651 has 4 divisors (see below), whose sum is σ = 209895783312. Its totient is φ = 192404467992.
The previous prime is 201150125609. The next prime is 201150125653. The reversal of 201150125651 is 156521051102.
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 201150125651 - 214 = 201150109267 is a prime.
It is a super-2 number, since 2×2011501256512 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201150125653) 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, 4372828796 + ... + 4372828841.
It is an arithmetic number, because the mean of its divisors is an integer number (52473945828).
Almost surely, 2201150125651 is an apocalyptic number.
201150125651 is a deficient number, since it is larger than the sum of its proper divisors (8745657661).
201150125651 is an equidigital number, since it uses as much as digits as its factorization.
201150125651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8745657660.
The product of its (nonzero) digits is 3000, while the sum is 29.
Adding to 201150125651 its reverse (156521051102), we get a palindrome (357671176753).
The spelling of 201150125651 in words is "two hundred one billion, one hundred fifty million, one hundred twenty-five thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •