Base | Representation |
---|---|
bin | 1100100110111001101… |
… | …1011011111111111011 |
3 | 202201002022002110110000 |
4 | 3021232123123333323 |
5 | 12022044332114011 |
6 | 243301040124043 |
7 | 21435401361663 |
oct | 3115633337773 |
9 | 681068073400 |
10 | 216601051131 |
11 | 83950712673 |
12 | 35b8b306623 |
13 | 1756b77b55a |
14 | a6aabd11a3 |
15 | 597aae4356 |
hex | 326e6dbffb |
216601051131 has 20 divisors (see below), whose sum is σ = 332309525152. Its totient is φ = 140497977168.
The previous prime is 216601051087. The next prime is 216601051159. The reversal of 216601051131 is 131150106612.
216601051131 is a `hidden beast` number, since 2 + 1 + 6 + 601 + 0 + 51 + 1 + 3 + 1 = 666.
It is not a de Polignac number, because 216601051131 - 26 = 216601051067 is a prime.
It is a super-2 number, since 2×2166010511312 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 216601051095 and 216601051104.
It is not an unprimeable number, because it can be changed into a prime (216601051171) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 36133315 + ... + 36139308.
Almost surely, 2216601051131 is an apocalyptic number.
216601051131 is a deficient number, since it is larger than the sum of its proper divisors (115708474021).
216601051131 is an equidigital number, since it uses as much as digits as its factorization.
216601051131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72272672 (or 72272663 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 27.
Adding to 216601051131 its reverse (131150106612), we get a palindrome (347751157743).
The spelling of 216601051131 in words is "two hundred sixteen billion, six hundred one million, fifty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •