Base | Representation |
---|---|
bin | 11001101111100010… |
… | …100011000001111101 |
3 | 2122100100122221121112 |
4 | 121233202203001331 |
5 | 423102112144013 |
6 | 20410445211405 |
7 | 1665654511100 |
oct | 315742430175 |
9 | 78310587545 |
10 | 27641131133 |
11 | 107a4774a30 |
12 | 5434b60b65 |
13 | 27b677aac5 |
14 | 14a3054737 |
15 | abb9c9ba8 |
hex | 66f8a307d |
27641131133 has 24 divisors (see below), whose sum is σ = 35273141280. Its totient is φ = 21418141920.
The previous prime is 27641131093. The next prime is 27641131151. The reversal of 27641131133 is 33113114672.
It is not a de Polignac number, because 27641131133 - 26 = 27641131069 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 27641131133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27641133133) 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 23 ways as a sum of consecutive naturals, for example, 46766 + ... + 239727.
It is an arithmetic number, because the mean of its divisors is an integer number (1469714220).
Almost surely, 227641131133 is an apocalyptic number.
It is an amenable number.
27641131133 is a deficient number, since it is larger than the sum of its proper divisors (7632010147).
27641131133 is a wasteful number, since it uses less digits than its factorization.
27641131133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 286697 (or 286690 counting only the distinct ones).
The product of its digits is 9072, while the sum is 32.
The spelling of 27641131133 in words is "twenty-seven billion, six hundred forty-one million, one hundred thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •