Base | Representation |
---|---|
bin | 1100101000001010000… |
… | …0001000101001000001 |
3 | 202201221202210102220221 |
4 | 3022002200020221001 |
5 | 12023242040430011 |
6 | 243354310303041 |
7 | 21446631050326 |
oct | 3120240105101 |
9 | 681852712827 |
10 | 216937826881 |
11 | 84003825236 |
12 | 36064057a81 |
13 | 175c3484449 |
14 | a6dd818b4d |
15 | 599a469971 |
hex | 3282808a41 |
216937826881 has 4 divisors (see below), whose sum is σ = 217802121264. Its totient is φ = 216073532500.
The previous prime is 216937826873. The next prime is 216937826891. The reversal of 216937826881 is 188628739612.
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 216937826881 - 23 = 216937826873 is a prime.
It is a super-2 number, since 2×2169378268812 (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 (216937826891) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 432146815 + ... + 432147316.
It is an arithmetic number, because the mean of its divisors is an integer number (54450530316).
Almost surely, 2216937826881 is an apocalyptic number.
It is an amenable number.
216937826881 is a deficient number, since it is larger than the sum of its proper divisors (864294383).
216937826881 is an equidigital number, since it uses as much as digits as its factorization.
216937826881 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 864294382.
The product of its digits is 13934592, while the sum is 61.
The spelling of 216937826881 in words is "two hundred sixteen billion, nine hundred thirty-seven million, eight hundred twenty-six thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •