Base | Representation |
---|---|
bin | 1110111010111111100010… |
… | …0011010100000010110101 |
3 | 2011002110102122200202211201 |
4 | 3232233320203110002311 |
5 | 4122301304412011013 |
6 | 54521035551132501 |
7 | 3312225040640623 |
oct | 356577043240265 |
9 | 64073378622751 |
10 | 16406650110133 |
11 | 52560262a2a58 |
12 | 1a0b875b14131 |
13 | 9201a97b455a |
14 | 40a12c39c513 |
15 | 1d6b945273dd |
hex | eebf88d40b5 |
16406650110133 has 2 divisors, whose sum is σ = 16406650110134. Its totient is φ = 16406650110132.
The previous prime is 16406650110101. The next prime is 16406650110143. The reversal of 16406650110133 is 33101105660461.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16394020396209 + 12629713924 = 4048953^2 + 112382^2 .
It is a cyclic number.
It is not a de Polignac number, because 16406650110133 - 25 = 16406650110101 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16406650110092 and 16406650110101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16406650110143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8203325055066 + 8203325055067.
It is an arithmetic number, because the mean of its divisors is an integer number (8203325055067).
Almost surely, 216406650110133 is an apocalyptic number.
It is an amenable number.
16406650110133 is a deficient number, since it is larger than the sum of its proper divisors (1).
16406650110133 is an equidigital number, since it uses as much as digits as its factorization.
16406650110133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 38880, while the sum is 37.
Adding to 16406650110133 its reverse (33101105660461), we get a palindrome (49507755770594).
The spelling of 16406650110133 in words is "sixteen trillion, four hundred six billion, six hundred fifty million, one hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •