Base | Representation |
---|---|
bin | 11000010011011110000100… |
… | …000101000100001101000001 |
3 | 112000110200112020122120002001 |
4 | 120103132010011010031001 |
5 | 103002300401124003001 |
6 | 1015201024524224001 |
7 | 31341424200261022 |
oct | 3023360405041501 |
9 | 460420466576061 |
10 | 106891067016001 |
11 | 31071279760314 |
12 | bba425609b001 |
13 | 4784a27347098 |
14 | 1c577ab858c49 |
15 | c557368e4001 |
hex | 613784144341 |
106891067016001 has 2 divisors, whose sum is σ = 106891067016002. Its totient is φ = 106891067016000.
The previous prime is 106891067015917. The next prime is 106891067016053. The reversal of 106891067016001 is 100610760198601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 92964287956401 + 13926779059600 = 9641799^2 + 3731860^2 .
It is a cyclic number.
It is not a de Polignac number, because 106891067016001 - 223 = 106891058627393 is a prime.
It is a super-2 number, since 2×1068910670160012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (106891067016061) 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, 53445533508000 + 53445533508001.
It is an arithmetic number, because the mean of its divisors is an integer number (53445533508001).
Almost surely, 2106891067016001 is an apocalyptic number.
It is an amenable number.
106891067016001 is a deficient number, since it is larger than the sum of its proper divisors (1).
106891067016001 is an equidigital number, since it uses as much as digits as its factorization.
106891067016001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108864, while the sum is 46.
The spelling of 106891067016001 in words is "one hundred six trillion, eight hundred ninety-one billion, sixty-seven million, sixteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •