Base | Representation |
---|---|
bin | 110001001111000110101101… |
… | …010001101110101011101111 |
3 | 1001101201020110100020010010021 |
4 | 301033012231101232223233 |
5 | 211340312033424042323 |
6 | 2044314051431423011 |
7 | 63416443253141422 |
oct | 6117065521565357 |
9 | 1041636410203107 |
10 | 216542273268463 |
11 | 62aa707601851a |
12 | 20353415224a67 |
13 | 93a9b0592027c |
14 | 3b689b82039b9 |
15 | 1a07b64e2605d |
hex | c4f1ad46eaef |
216542273268463 has 8 divisors (see below), whose sum is σ = 217982539710000. Its totient is φ = 215103370074048.
The previous prime is 216542273268457. The next prime is 216542273268473. The reversal of 216542273268463 is 364862372245612.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 216542273268463 - 217 = 216542273137391 is a prime.
It is a super-2 number, since 2×2165422732684632 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (216542273268473) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 340493038 + ... + 341128411.
It is an arithmetic number, because the mean of its divisors is an integer number (27247817463750).
Almost surely, 2216542273268463 is an apocalyptic number.
216542273268463 is a deficient number, since it is larger than the sum of its proper divisors (1440266441537).
216542273268463 is a wasteful number, since it uses less digits than its factorization.
216542273268463 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 681623561.
The product of its digits is 139345920, while the sum is 61.
The spelling of 216542273268463 in words is "two hundred sixteen trillion, five hundred forty-two billion, two hundred seventy-three million, two hundred sixty-eight thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •