Base | Representation |
---|---|
bin | 11110101000100001… |
… | …11010000110101101 |
3 | 1120110011020122102021 |
4 | 33110100322012231 |
5 | 232140200311411 |
6 | 11315533030141 |
7 | 1121356402006 |
oct | 172420720655 |
9 | 46404218367 |
10 | 16446103981 |
11 | 6a7a44037a |
12 | 322b925351 |
13 | 172131a798 |
14 | b202d81ad |
15 | 663c64a71 |
hex | 3d443a1ad |
16446103981 has 2 divisors, whose sum is σ = 16446103982. Its totient is φ = 16446103980.
The previous prime is 16446103951. The next prime is 16446104047. The reversal of 16446103981 is 18930164461.
16446103981 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8280090025 + 8166013956 = 90995^2 + 90366^2 .
It is a cyclic number.
It is not a de Polignac number, because 16446103981 - 27 = 16446103853 is a prime.
It is a super-2 number, since 2×164461039812 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16446103951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8223051990 + 8223051991.
It is an arithmetic number, because the mean of its divisors is an integer number (8223051991).
Almost surely, 216446103981 is an apocalyptic number.
It is an amenable number.
16446103981 is a deficient number, since it is larger than the sum of its proper divisors (1).
16446103981 is an equidigital number, since it uses as much as digits as its factorization.
16446103981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 124416, while the sum is 43.
The spelling of 16446103981 in words is "sixteen billion, four hundred forty-six million, one hundred three thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •