Base | Representation |
---|---|
bin | 1100100110000001101… |
… | …0111101100001011011 |
3 | 202200110220212221000102 |
4 | 3021200122331201123 |
5 | 12021104201422100 |
6 | 243221443130015 |
7 | 21426516016502 |
oct | 3114032754133 |
9 | 680426787012 |
10 | 216366045275 |
11 | 8383aaa0256 |
12 | 35b2467390b |
13 | 17531b88933 |
14 | a6878d9839 |
15 | 5965172cd5 |
hex | 32606bd85b |
216366045275 has 6 divisors (see below), whose sum is σ = 268293896172. Its totient is φ = 173092836200.
The previous prime is 216366045271. The next prime is 216366045281. The reversal of 216366045275 is 572540663612.
216366045275 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 216366045275 - 22 = 216366045271 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (216366045271) 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 5 ways as a sum of consecutive naturals, for example, 4327320881 + ... + 4327320930.
It is an arithmetic number, because the mean of its divisors is an integer number (44715649362).
Almost surely, 2216366045275 is an apocalyptic number.
216366045275 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
216366045275 is a deficient number, since it is larger than the sum of its proper divisors (51927850897).
216366045275 is an equidigital number, since it uses as much as digits as its factorization.
216366045275 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8654641821 (or 8654641816 counting only the distinct ones).
The product of its (nonzero) digits is 1814400, while the sum is 47.
The spelling of 216366045275 in words is "two hundred sixteen billion, three hundred sixty-six million, forty-five thousand, two hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •