Base | Representation |
---|---|
bin | 1100100110001011111… |
… | …1111111100011001101 |
3 | 202200120221021212102011 |
4 | 3021202333333203031 |
5 | 12021201240313331 |
6 | 243230030301221 |
7 | 21430552522123 |
oct | 3114277774315 |
9 | 680527255364 |
10 | 216409307341 |
11 | 83862459727 |
12 | 35b37057811 |
13 | 1753ab251a6 |
14 | a68d55b913 |
15 | 5968d6b3b1 |
hex | 3262fff8cd |
216409307341 has 4 divisors (see below), whose sum is σ = 216411442912. Its totient is φ = 216407171772.
The previous prime is 216409307329. The next prime is 216409307357. The reversal of 216409307341 is 143703904612.
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 216409307341 - 29 = 216409306829 is a prime.
It is a super-2 number, since 2×2164093073412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 216409307294 and 216409307303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (216409307311) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 907791 + ... + 1121116.
It is an arithmetic number, because the mean of its divisors is an integer number (54102860728).
Almost surely, 2216409307341 is an apocalyptic number.
It is an amenable number.
216409307341 is a deficient number, since it is larger than the sum of its proper divisors (2135571).
216409307341 is a wasteful number, since it uses less digits than its factorization.
216409307341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2135570.
The product of its (nonzero) digits is 108864, while the sum is 40.
The spelling of 216409307341 in words is "two hundred sixteen billion, four hundred nine million, three hundred seven thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •